New facets for the two-stage uncapacitated facility location polytope

Computational Optimization and Applications

Volumn 44, Issue 3, 2009, Pages 487-519

  Landete, Mercedes ^a   Marín, Alfredo ^b  

^a MIGUEL HERNÁNDEZ UNIVERSITY   (Spain)

^b UNIVERSITY OF MURCIA   (Spain)

Author keywords

Combinatorial optimization; Facet; Location; Set packing; Two stage

Indexed keywords

COMPUTATIONAL STUDIES; CONVEX HULL; FACET-DEFINING INEQUALITIES; FACILITY LOCATION PROBLEM; FACILITY LOCATIONS; FEASIBLE SOLUTION; IN-PLANTS; POLYTOPES; SET PACKING; SET PACKING PROBLEM; TOTAL COSTS; TWO STAGE;

COMBINATORIAL OPTIMIZATION;

STAGES;

EID: 74249108916     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-008-9165-x     Document Type: Article

References (39)

1. K. Aardal M. Labbé J. Leung M. Queyranne 1996 On the two-level uncapacitated facility location problem INFORMS J. Comput. 8 3 289 301 0863.90102 10.1287/ijoc.8.3.289
2. F. Barahona A.R. Mahjoub 1994 Compositions of graphs and polyhedra II: Stable sets SIAM J. Discrete Math. 7 359 371 0802.05068 10.1137/ S0895480190182678 1285576
3. A.I. Barros M. Labbé 1994 A general model for the uncapacitated facility and depot location problem Location Sci. 2 173 191 0919.90097
4. W.J. Baumol P. Wolfe 1958 A warehouse-location problem Oper. Res. 6 252 263 10.1287/opre.6.2.252 92693
5. J.M. Bloemhof-Ruwaard M. Salomon L.N. Van Wassenhove 1994 On the coordination of product and by-product flows in two level distribution networks: model formulation and solution procedures Eur. J. Oper. Res. 79 325 339 0812.90091 10.1016/0377-2217(94)90362-X
6. J.M. Bloemhof-Ruwaard M. Salomon L.N. Van Wassenhove 1996 The capacitated distribution and waste disposal problem Eur. J. Oper. Res. 88 490 503 0911.90236 10.1016/0377-2217(94)00211-8 (Pubitemid 126368050)
7. A. Bumb 2001 An approximation algorithm for the maximization version of the two level uncapacitated facility location problem Oper. Res. Lett. 29 155 161 0993.90066 10.1016/S0167-6377(01)00087-6 1876972
8. L. Cánovas M. Landete A. Marín 2000 New facets for the set packing polytope Oper. Res. Lett. 27 4 153 161 1096.90548 10.1016/S0167-6377(00) 00056-0 1801625 (Pubitemid 32035500)
9. L. Cánovas M. Landete A. Marín 2003 Facet obtaining procedures for set packing problems SIAM J. Discrete Math. 16 1 127 155 1029.05131 10.1137/S0895480100366786
10. P. Chardaire J.-L. Lutton A. Sutter 1999 Upper and lower bounds for the two-level simple plant location problem Ann. Oper. Res. 86 117 140 0918.90095 10.1023/A:1018942415824 1683477
11. E. Cheng W.H. Cunningham 1997 Wheel inequalities for stable set polytopes Math. Program. 77 389 421 1447564
12. D.C. Cho E.L. Johnson M.W. Padberg M.R. Rao 1983 On the uncapacitated plant location problem I: Valid inequalities and facets Math. Oper. Res. 8 4 579 589 0536.90029 10.1287/moor.8.4.579 727413
13. T.G. Crainic L. Delorme 1993 Dual-ascent procedures for multicommodity location-allocation problems with balancing requirements Transp. Sci. 27 90 101 0788.90043 10.1287/trsc.27.2.90 1218608
14. D.G. Elson 1972 Site location via mixed-integer programming Oper. Res. Q. 23 1 31 43 0231.90027 10.1057/jors.1972.4
15. L.-L. Gao E.P. Robinson Jr. 1992 A dual-based optimization procedure for the two-echelon uncapacitated facility location problem Nav. Res. Logist. 39 191 212 0773.90042 10.1002/1520-6750(199203)39:2<191::AID-NAV3220390205>3.0. CO;2-T
16. L.-L. Gao E.P. Robinson Jr. 1994 Uncapacitated facility location: General solution procedure and computational experience Eur. J. Oper. Res. 76 410 427 0810.90085 10.1016/0377-2217(94)90277-1
17. B. Gendron T.G. Crainic 1995 A branch-and-bound algorithm for depot location and container fleet management Location Sci. 3 39 53 0917.90227 10.1016/0966-8349(95)00005-3 (Pubitemid 26432193)
18. B. Gendron T.G. Crainic 1997 A parallel branch-and-bound algorithm for multicommodity location with balancing requirements Comput. Oper. Res. 24 829 847 0893.90116 10.1016/S0305-0548(96)00094-9 1461412
19. A.M. Geoffrion G.W. Graves 1974 Multicommodity distribution system design by Benders decomposition Manag. Sci. 20 822 844 0304.90122 10.1287/mnsc.20.5. 822 329614
20. M. Guignard 1980 Fractional vertices, cuts and facets of the simple plant location problem Math. Progam. Study 12 150 162 0439.90061 571861
21. Y. Hinojosa J. Puerto F.R. Fernández 2000 A multiperiod two-echelon multicommodity capacitated plant location problem Eur. J. Oper. Res. 123 271 291 0967.90069 10.1016/S0377-2217(99)00256-8 (Pubitemid 30596945)
22. L. Kaufman M.V. Eede P. Hansen 1977 A plant and warehouse location problem Oper. Res. Q. 28 547 554 0375.90074 10.1057/jors.1977.104
23. J.G. Klincewicz 1985 A large-scale distribution and location model ATT Techn. J. 64 7 1705 1730
24. A. Klose 1999 An LP-based heuristic for two-stage capacitated facility location problems J. Oper. Res. Soc. 50 157 166 1054.90590 10.1057/palgrave. jors.2600675
25. A. Klose 2000 A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem Eur. J. Oper. Res. 126 408 421 0971.90043 10.1016/S0377-2217(99)00300-8 1785805
26. A. Marín 2007 Lower bounds for the two-stage uncapacitated facility location problem Eur. J. Oper. Res. 179 1126 1142 1163.90608 10.1016/j.ejor.2005.04.052 (Pubitemid 46038600)
27. A. Marín B. Pelegrín 1997 A branch-and-bound algorithm for the transportation problem with location of p transshipment points Comput. Oper. Res. 7 659 678 10.1016/S0305-0548(96)00078-0
28. A. Marín B. Pelegrín 1998 The return plant location problem: Modelling and resolution Eur. J. Oper. Res. 104 2 375 392 0955.90062 10.1016/S0377-2217(97)00192-6
29. A. Marín B. Pelegrín 1999 Applying Lagrangean relaxation to the resolution of two-stage location problems Ann. Oper. Res. 86 179 198 0921.90104 10.1023/A:1018998500803 1683410
30. S. Moon 1989 A profit-maximizing plant-loading model with demand fill-rate constraints J. Oper. Res. Soc. 40 11 1019 1027 0684.90045 10.1057/jors.1989.175
31. G.L. Nemhauser L.E. Trotter Jr. 1974 Properties of vertex packing and independence system polyhedra Math. Program. 6 48 61 0281.90072 10.1007/BF01580222 379294
32. M.W. Padberg 1973 On the facial structure of set packing polyhedra Math. Program. 5 199 215 0272.90041 10.1007/BF01580121 368749
33. M.W. Padberg 1975 A note on zero-one programming Oper. Res. 23 833 837 0311.90053 10.1287/opre.23.4.833 411622
34. M.W. Padberg 1977 On the complexity of set packing polyhedra Ann. Discrete Math. 1 421 434 10.1016/S0167-5060(08)70750-7 680798
35. H. Pirkul V. Jayaraman 1996 Production, transportation, and distribution planning in a multi-commodity tri-echelon system Transp. Sci. 30 4 291 302 0879.90129 10.1287/trsc.30.4.291
36. H. Pirkul V. Jayaraman 1998 A multi-commodity, multi-plant, capacitated facility location problem: formulation and efficient heuristic solution Comput. Oper. Res. 25 10 869 878 1042.90580 10.1016/S0305-0548(97)00096-8 1657068
37. H. Ro D. Tcha 1984 A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints Eur. J. Oper. Res. 18 349 358 0555.90036 10.1016/0377-2217(84)90156-5 810303 (Pubitemid 15425028)
38. S. Tragantalerngsak J. Holt M. Ronnqvist 1997 Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem Eur. J. Oper. Res. 102 611 625 0951.90561 10.1016/S0377-2217(96)00227-5
39. L.E. Trotter 1975 A class of facet producing graphs for vertex packing polyhedra Discrete Math. 12 373 388 0314.05111 10.1016/0012-365X(75)90077-1 398908