Multi-period capacitated location with modular equipments

Computers and Operations Research

Volumn 35, Issue 3, 2008, Pages 661-682

  Gourdin, Éric ^a   Klopfenstein, Olivier ^a  

^a ORANGE LABS   (France)

Author keywords

Capacitated location; MIP optimization; Multi period location; Polyhedral analysis

Indexed keywords

INSTALLATION; INTEGER PROGRAMMING; MATHEMATICAL MODELS; NUMERICAL METHODS; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS;

CAPACITATED LOCATION; INTEGER LINEAR MODELS; MIP OPTIMIZATION; MULTI-PERIOD LOCATION; POLYHEDRAL ANALYSIS;

CRITICAL PATH ANALYSIS;

EID: 34548383816     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.05.007     Document Type: Article

References (17)

1. Gourdin E., Labbé M., and Yaman H. Telecommunication and location: applications and theory. In: Drezner Z., and Hamacher H.W. (Eds). Facility location (2002), Springer, Berlin 275-305
2. Sridharan R. The capacitated plant location problem. European Journal of Operational Research 87 (1995) 203-213
3. Aardal K. Capacitated facility location: separation algorithms and computational experience. Mathematical Programming 81 (1998) 149-175
4. Aardal K. Reformulation of capacitated facility location problems: how redundant information can help. Annals of Operations Research 82 (1998) 289-308
5. Leung J.M.Y., and Magnanti T.L. Valid inequalities and facets of the capacitated plant location problem. Mathematical Programming 44 (1989) 271-291
6. Chardaire P., Sutter A., and Costa M.-C. Solving the dynamic facility location problem. Networks 28 (1996) 117-124
7. Hakimi S.L., Labbé M., and Schmeichel E.F. Locations on time-varying networks. Networks 34 (1999) 250-257
8. Van Roy T.J., and Erlenkotter D. A dual-based procedure for dynamic facility location. Management Science 28 (1982) 1091-1105
9. Antunes A., and Peeters D. On solving complex multi-period location models using simulated annealing. European Journal of Operational Research 130 (2001) 190-201
10. Jacobsen K. Multiperiod capacitated location models. In: Mirchandani P.B., and Francis R.L. (Eds). Discrete location theory (1990), Wiley, New York 173-208
11. Shulman A. An algorithm for solving dynamic capacitated plant location problems with discrete expansion sizes. Operations Research 39 (1991) 423-436
12. Erlenkotter D. A comparative study of approaches to dynamic location problems. European Journal of Operational Research 6 (1979) 133-143
13. Shmoys D., Tardos E., and Aardal K. Approximation algorithms for facility location problems. Proceedings of the 29th annual ACM symposium on theory of computing (1997) 265-274
14. Padberg M.W., van Roy T.J., and Wolsey L.A. Valid linear inequalities for fixed charge problems. Operations Research 33 (1985) 842-861
15. ILOG CPLEX. Using the CPLEX callable library and CPLEX mixed integer library. Incline Village, NJ: ILOG; 2004.
16. Nemhauser G.L., and Wolsey L.A. Integer and combinatorial optimization (1999), Wiley, New York
17. Balakrishnan A., Magnanti T.L., and Wong R.T. A decomposition algorithm for local access telecommunications network expansion. Operations Research 43 (1995) 58-76