Reformulation of capacitated facility location problems:How redundant information can help

Karen Aardal

Annals of Operations Research, 1998, vol. 82, issue 0, 289-308

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. Copyright Kluwer Academic Publishers 1998

Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018966804496 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:82:y:1998:i:0:p:289-308:10.1023/a:1018966804496

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018966804496

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().