Adapting polyhedral properties from facility to hub location problems

Discrete Applied Mathematics

Volumn 145, Issue 1 SPEC. ISS., 2004, Pages 104-116

  Hamacher, Horst W ^a   Labbé, Martine ^b   Nickel, Stefan ^c,d   Sonneborn, Tim ^e  

^a Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^c SAARLAND UNIVERSITY   (Germany)

^d FRAUNHOFER INSTITUTE FOR INDUSTRIAL MATHEMATICS ITWM   (Germany)

^e University Hospital   (Germany)

Author keywords

Facet; Facility location; Hub location; Integer programming; Valid inequality

Indexed keywords

CONSTRAINT THEORY; COST ACCOUNTING; FREIGHT TRANSPORTATION; INTEGER PROGRAMMING; OPTIMIZATION; TELECOMMUNICATION;

CARGO TRANSPORTATION; FACET; HUB LOCATION; VALID INEQUALITY;

PROBLEM SOLVING;

EID: 4944226646     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2003.09.011     Document Type: Conference Paper

References (24)

1. Aardal K., Labbé M., Leung J., Queyranne M. On the two-level uncapacitated facility location problem. INFORMS J. Comput. 8(3):1996;289-301.
2. Campbell J.F. Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. 72:1994;387-405.
3. Campbell J.F., Ernst A.T., Krishnamoorthy M. Hub location problems. Drezner Z., Hamacher H.W. Facility Location: Applications and Theory. 2002;373-407 Springer, Berlin, Heidelberg, New York.
4. Cánovas L., Landete M., Marín A. New facets for the set packing polytope. Oper. Res. Lett. 27:2000;153-161.
5. Cánovas L., Landete M., Marín A. On the facets of the simple plant location packing polytope. Discrete Appl. Math. 124(1):2002;27-53.
6. Cho D.C., Johnson E.L., Padberg M., Rao M.R. On the uncapacitated plant location problem I. valid inequalities and facets Math. Oper. Res. 8:1983;579-589.
7. Cho D.C., Padberg M., Rao M.R. On the uncapacitated plant location problem II. facets and lifting theorems Math. Oper. Res. 8:1983;590-612.
8. Cornuéjols G., Padberg M., Wolsey L.A. The uncapacitated facility location problem. Mirchandani P., Francis R. Discrete Location Theory. 1990;119-172 Wiley, New York.
9. Cornuéjols G., Thizy J.-M. Some facets of the simple plant location polytope. Math. Programming. 23:1982;50-74.
10. Ebery J., Krishnamoorthy M., Ernst A.T., Boland N. The capacitated multiple allocation hub location problem. formulations and algorithms Eur. J. Oper. Res. 120(3):2000;614-631.
11. Ernst A.T., Krishnamoorthy M. Efficient algorithms for the uncapacitated single allocation. p -hub median problem Location Sci. 4(3):1996;139-154.
12. Ernst A.T., Krishnamoorthy M. Exact and heuristic algorithms for the uncapacitated multiple allocation. p -hub median problem Eur. J. Oper. Res. 104:1998;100-112.
13. Grötschel M., Lovász L., Schrijver A. Geometrics Algorithms and Combinatorial Optimization. 1988;Springer, Berlin, Heidelberg.
14. Guignard M. Fractional vertices, cuts and facets of the simple plant location problem. Math. Programming. 12:1980;150-162.
15. Krarup J., Pruzan P.M. The simple plant location problem. survey and synthesis Eur. J. Oper. Res. 12:1983;36-81.
16. A. Marín, Private communication, 2001.
17. Nemhauser G., Wolsey L. Integer and Combinatorical Optimization. 1988;Wiley, New York.
18. Nickel S., Schöbel A., Sonneborn T. Hub location problems in urban traffic networks. Niittymaki J., Pursula M. Mathematics Methods and Optimization in Transportation Systems. 2001;95-107 Kluwer Academic Publishers, Dordrecht.
19. O'Kelly M.E. A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. 32:1987;393-404.
20. Padberg M.W. On the facial structure of set packing polyhedra. Math. Programming. 5:1973;199-215.
21. Skorin-Kapov D., Skorin-Kapov J., O'Kelly M. Tight linear programming relaxations of uncapacitated. p -hub median problems Eur. J. Oper. Res. 94:1996;582-593.
22. Sohn J., Park S. A linear program for the two-hub location problem. Eur. J. Oper. Res. 100(3):1997;617-622.
23. Sohn J., Park S. The single allocation problem in the interacting three-hub network. Networks. 35:2000;17-25.
24. T. Sonneborn, The uncapacitated hub location problem: polyhedral analysis and applications, Shaker Verlag Aachen, 2003, also: Ph.D. Thesis, Universität Kaiserslautern, 2002.