Discretized formulations for capacitated location problems with modular distribution costs

European Journal of Operational Research

Volumn 204, Issue 2, 2010, Pages 237-244

  Correia, Isabel ^a   Gouveia, Luís ^b   Saldanha da Gama, Francisco ^b  

^a UNIVERSIDADE NOVA DE LISBOA   (Portugal)

^b UNIVERSITY OF LISBON   (Portugal)

Author keywords

Capacitated facility location; Extended reformulations; Modular link costs

Indexed keywords

CAPACITATED LOCATION; COMPUTATIONAL RESULTS; CONVEX HULL; DISCRETIZATIONS; DISCRETIZED MODELS; DISTRIBUTION COSTS; FACILITY LOCATION PROBLEM; FACILITY LOCATIONS; IN-NETWORK; INTEGER SOLUTIONS; KNAPSACK PROBLEMS; LINEAR PROGRAMMING RELAXATION; LINK COST; OBJECTIVE FUNCTIONS; ORIGINAL MODEL; VALID INEQUALITY; VARIABLE COEFFICIENTS;

COSTS; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; LINEAR PROGRAMMING; LINEARIZATION; OPTIMIZATION; PROBLEM SOLVING; SITE SELECTION;

FACILITIES;

EID: 71649083073     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2009.10.027     Document Type: Article

References (14)

1. Agra A., and Constantino M. Description of 2-integer continuous knapsack polyhedra. Discrete Optimization 3 (2006) 95-110
2. Correia I., and Captivo M.E. A Lagrangean heuristic for a modular capacitated location problem. Annals of Operations Research 122 (2003) 141-161
3. Frangioni A., and Gendron B. 0-1 reformulations of the multicommodity capacitated network design problem. Discrete Applied Mathematics 157 (2009) 1229-1241
4. Geoffrion A.M. Lagrangean relaxation and its uses in integer programming. Mathematical Programming Study 2 (1974) 82-114
5. Gouveia L. A 2n constraint formulation for the capacitated minimal spanning tree problem. Operations Research 43 (1995) 130-141
6. Gouveia L., and Saldanha-da-Gama F. On the capacitated concentrator location problem: a reformulation by discretization. Computers and Operations Research 33 (2006) 1242-1258
7. Hajiaghayi M.T., Mahdian M., and Mirrokni V.S. The facility location problem with general cost functions. Networks 42 (2003) 42-47
8. Holmberg K. Exact solution methods for uncapacitated location problems with convex transportation costs. European Journal of Operational Research 114 (1999) 127-140
9. Leung J.M.Y., and Magnanti T.L. Valid inequalities and facets of the capacitated plant location problem. Mathematical Programming 44 (1989) 271-291
10. Magnanti T., Mirchandani P., and Vachani R. The convex hull of two core capacitated network design problems. Mathematical Programming 60 (1993) 223-250
11. Magnanti T., Mirchandani P., and Vachani R. Modeling and solving the two-facility capacitated network loading problem. Operations Research 43 (1995) 142-157
12. Melkote S., and Daskin M.S. Capacitated facility location/network design. European Journal of Operational Research 129 (2001) 481-495
13. Pochet Y., and Wolsey L. Integer knapsack and flow covers with divisible coefficients: polyhedra, optimization, and separation. Discrete Applied Mathematics 59 (1995) 57-74
14. Wu L.-Y., Zhang X.-S., and Zhang J.-L. Capacitated facility location problem with general setup cost. Computers and Operations Research 33 (2006) 1226-1241