A cutting plane algorithm for the capacitated facility location problem

Computational Optimization and Applications

Volumn 43, Issue 1, 2009, Pages 39-65

  Avella, Pasquale ^a   Boccia, Maurizio ^a  

^a UNIVERSITY OF SANNIO   (Italy)

Author keywords

Capacitated facility location problem; Facet enumeration; Mixed dicut inequalities

Indexed keywords

BRANCH-AND-CUT-AND-PRICE ALGORITHM; CAPACITATED FACILITY LOCATION PROBLEM; CAPACITATED FACILITY LOCATION PROBLEMS; CAPACITY CONSTRAINTS; CONTINUOUS VARIABLES; CONVEX HULL; CUTTING PLANE ALGORITHMS; EFFECTIVE CAPACITY; FACET-ENUMERATION; FEASIBLE SOLUTION; FLOW VARIABLE; KNAPSACK PROBLEMS; LIFTING PROCEDURES; MINIMUM COST; MIXED DICUT INEQUALITIES; MIXED TYPE; MULTISOURCE; POLYTOPE; SEPARATION ALGORITHMS; VALID INEQUALITY; VARIABLE UPPER BOUND;

FACILITIES; INTEGER PROGRAMMING;

SET THEORY;

EID: 67449083288     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-007-9125-x     Document Type: Article

References (19)

1. Aardal, K.: 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)
2. K. Aardal 1998 Capacitated facility location: separation algorithms and computational experience Math. Program. 81 149 175
3. K. Aardal Y. Pochet L.A. Wolsey 1995 Capacitated facility location: valid inequalities and facets Math. Operat. Res. 20 562 582
4. R. Anbil F. Barahona 2000 The volume algorithm: producing primal solutions with a subgradient method Math. Program. Ser. A 87 385 399
5. Avella, P., Boccia, M., Sforza, A., Vasiliev, I.: An effective heuristic for large-scale capacitated plant location problems. Technical Report, available online at http://www.ing.unisannio.it/boccia/ (2004)
6. P. Avella A. Sassano I. Vasil'ev 2007 Computational study of large-scale p-median problems Math. Program. 109 1 89 114
7. Barahona, F., Chudak, F.A.: Near-optimal solution to large scale facility location problems. Internal report, IBM research division, T.J. Watson Research Center, RC 21606 (1999)
8. C.B. Barber D.P. Dobkin H.T. Huhdanpaa 1996 The quickhull algorithm for convex hulls ACM Trans. Math. Softw. 22 4 469 483 (Pubitemid 126417394) (Pubitemid 126417394)
9. J.E. Beasley 1990 OR-Library: distributing test problems by electronic mail J. Operat. Res. Soc. 41 11 1069 1072
10. J.E. Beasley 1993 Lagrangean heuristics for location problems Eur. J. Operat. Res. 65 383 399
11. Bertsimas, D., Tsitsiklis, J.N.: Introduction to Linear Optimization. Athena Scientific, Belmont (1997)
12. Chudak, F.A., Williamson, D.P.: Improved approximation algorithms for capacitated facility location problems. In: 7th International IPCO Conference Proceedings, pp. 99-113 (1999)
13. G. Cornuejols R. Sridharan J.M. Thizy 1991 A comparison of heuristics and relaxations for the capacitated plant location problem Eur. J. Oper. Res. 50 280 297
14. Klose, A., Görtz, S.: A branch-and-price algorithm for the capacitated facility location problem. Eur. J. Operat. Res. (2006, forthcoming). Available online at http://www.sciencedirect.com
15. Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. DIMACS Technical Report, pp. 98-30 (1998)
16. J.M.Y. Leung T.L. Magnanti 1989 Valid inequalities and facets of the capacitated plant location problem Math. Program. 44 271 291
17. H. Marchand L.A. Wolsey 1999 The 0-1 knapsack problem with a single continuous variable Math. Program. 85 15 33
18. Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)
19. F. Ortega L. Wolsey 2003 A branch and cut algorithm for the single commodity uncapacitated fixed charge network flow problem Networks 41 143 158