Computational experiments with location problems using automatic constraint generation
Jaime Barceló Bugeda · 1985
We report computational experience with the use of automatic constraint generation in the case of capacited location problems involving between 10 and 30 plants and up to 50 demand centers. For different types of model formulations different surrogate knapsack constraint are investigated and found to substantially impact in many cases the actual numerical results.