Abstract
When solving hard combinatorial optimization problems by branch-and-bound, obtaininga good lower bound (considering a minimization problem) from the linear relaxation iscrucial for the performance of the algorithm. On the other hand, we want to avoid an initialformulation that is too large. This requires careful modeling of the problem. One way ofobtaining a good linear formulation is by applying a cutting plane algorithm where strongcutting planes are added if they violate the current fractional solution. By “strong” cuttingplanes, we mean linear inequalities that define high-dimensional faces of the convex hull offeasible solutions. For some classes of inequalities, effective algorithms for identifyingviolated inequalities belonging to these classes have been implemented as standard featuresin commercial branch-and-bound packages. Such classes are for instance the knapsack coverinequalities and the flow cover inequalities that were originally developed for the knapsackproblem and the single-node flow problem. These problems form relaxations of severalcapacitated combinatorial optimization problems such as various capacitated facility locationproblems. If, however, we consider traditional models for location problems, then theknapsack and single-node flow relaxations are not explicitly stated in the models, andunless we modify the models, the mentioned classes of inequalities will not be generated“automatically” by the systems. The extra variables and constraints that we need to add tothe traditional models in order to make the various relaxations explicit are redundant, notonly to the integer formulation but also to the linear relaxation. Computational experimentsdo, however, indicate that the inequalities that are generated based on the relaxations arevery effective and that the gain from the stronger linear relaxation far outweighs the drawbackof expanding the traditional models.
Similar content being viewed by others
References
K. Aardal, On the solution of one-and two-level capacitated facility location problems by the cutting plane approach, Ph.D. Thesis, Université Catholique de Louvain, Louvain-la-Neuve, Belgium, 1992.
K. Aardal, Capacitated facility location: Separation algorithms and computational experience, Mathematical Programming 81(1998)149 – 175.
K. Aardal and C.P.M. Van Hoesel, Polyhedral techniques in combinatorial optimization II: Computations, Report UU-CS-1995-42, Department of Computer Science, Utrecht University, 1995. To appear in Statistica Neerlandica. Available via WWW at URL: ftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1995/.
K. Aardal and C.P.M. Van Hoesel, Polyhedral techniques in combinatorial optimization I: Theory, Statistica Neerlandica 50(1996)3 – 26.
K. Aardal, Y. Pochet and L.A. Wolsey, Capacitated facility location: Valid inequalities and facets, Mathematics of Operations Research 20(1995)562 – 582.
M. Dell'Amico, F.M. Maffioli and S. Martello (eds.), Annotated Bibliographies in Combinatorial Optimization, Wiley, Chichester, 1997.
D.C. Cho, E.L. Johnson, M.W. Padberg and M.R. Rao, On the uncapacitated plant location problem. I: Valid inequalities and facets, Mathematics of Operations Research 8(1983)579 – 589.
D.C. Cho, M. Padberg and M.R. Rao, On the uncapacitated plant location problem. II: Facets and lifting theorems, Mathematics of Operations Research 8(1983)590– 612.
G. Cornuéjols, R. Sridharan and J.-M. Thizy, A comparison of heuristics and relaxations for the capacitated plant location problem, European Journal of Operational Research 50(1991)280–297.
G. Cornuéjols and J.-M. Thizy, Some facets of the simple plant location problem, Mathematical Programming 23(1982)50 – 74.
CPLEX Optimization, Inc., Using the CPLEX Callable Library, 1989.
H. Crowder, E.L. Johnson and M. Padberg, Solving large-scale zero –one linear programming problems, Operations Research 5(1983)803 – 834.
M. Jünger, G. Reinelt and S. Thienel, Practical problem solving with cutting plane algorithms in combinatorial optimization, in: Combinatorial Optimization, eds. W. Cook, L. Lovász and P. Seymour, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 20, 1995, pp. 111– 152.
M. Labbé, D. Peeters and J.-F. Thisse, Location on Networks, in: Network Routing, eds. M.O. Ball, T.L. Magnanti, C.L. Monma and G.L. Nemhauser, Handbooks in Operations Research and Management Science, Volume 8, Elsevier, Amsterdam, 1995, pp. 551– 624.
J.M.Y. Leung and T.L. Magnanti, Valid inequalities and facets of the capacitated plant location problem, Mathematical Programming 44(1989)271 – 291.
G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.
M.W. Padberg, T.J. Van Roy and L.A. Wolsey, Valid inequalities for fixed charge problems, Operations Research 33(1985)842 – 861.
M.W.P. Savelsbergh, G.C. Sigismondi and G.L. Nemhauser, Functional description of MINTO, a Mixed INTeger Optimizer, Operations Research Letters 15(1995)47 – 58.
T.J. Van Roy and L.A. Wolsey, Solving mixed integer programming using automatic reformulation, Operations Research 35(1987)45 – 57.
L.A. Wolsey, Faces for a linear inequality in 0 – 1 variables, Mathematical Programming 8(1975)165 – 178.
Rights and permissions
About this article
Cite this article
Aardal, K. Reformulation of capacitated facility location problems:How redundant information can help. Annals of Operations Research 82, 289–308 (1998). https://doi.org/10.1023/A:1018966804496
Issue Date:
DOI: https://doi.org/10.1023/A:1018966804496