A local branching heuristic for the capacitated fixed-charge network design problem

Computers and Operations Research

Volumn 37, Issue 3, 2010, Pages 575-581

  Rodríguez Martín, Inmaculada ^a   José Salazar González, Juan ^a  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

Heuristics; Local branching; Network design

Indexed keywords

FIXED CHARGES; HEURISTIC APPROACH; HEURISTICS; LOCAL BRANCHING; META-HEURISTIC TECHNIQUES; NETWORK DESIGN; NETWORK DESIGN PROBLEMS; NP-HARD PROBLEM;

COMPUTATIONAL COMPLEXITY; DESIGN; MATHEMATICAL PROGRAMMING; PLASMA WAVES;

HEURISTIC METHODS;

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

References (18)

1. Magnanti T.L., and Wong R.T. Network design and transportation planning: models and algorithms. Transportation Science 18 (1984) 1-55
2. Gendron B, Crainic TG. Relaxations for multicommodity capacitated network design problems. Publication CRT-945, Centre de recherche sur les transports, Université de Montréal; 1994.
3. Holmberg K., and Yuan D. A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Operations Research 48 (2000) 461-481
4. Crainic T.G., Frangioni A., and Gendron B. Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Applied Mathematics 112 (2001) 73-99
5. Chouman M, Crainic TG, Gendron B. A cutting-plane algorithm based on cutset inequalities for multicommodity capacitated fixed charge network design. Publication CRT-2003-16, Centre de recherche sur les transports, Université de Montréal; 2003.
6. Costa A.M. A survey on Benders decomposition applied to fixed-charge network design problems. Computers & Operations Research 32 (2005) 1429-1450
7. Bienstock D., and Günlük O. Capacitated network design-polyhedral structure and computation. INFORMS Journal on Computing 8 (1996) 243-259
8. Günlük O. A branch-and-cut algorithm for capacitated network design problems. Mathematical Programming Series A 86 (1999) 17-39
9. Crainic T.G., Gendreau M., and Farvolden J.M. A simplex-based tabu search method for capacitated network design. INFORMS Journal on Computing 12 (2000) 223-236
10. Ghamlouche I., Crainic T.G., and Gendreau M. Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Operations Research 51 (2003) 655-667
11. Ghamlouche I., Crainic T.G., and Gendreau M. Path relinking. Cycle-based neighborhoods and capacitated multicommodity network design. Annals of Operations Research 131 (2004) 109-133
12. Crainic T.G., Gendreau M., and Hernu G. A solpe scaling/Lagrangian perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design. Journal of Heuristics 10 (2004) 525-545
13. Crainic T.G., Li Y., and Toulouse M. A first multilevel cooperative algorithm for capacitated multicommodity network design. Computers & Operations Research 33 (2006) 2602-2622
14. Fischetti M., and Lodi A. Local branching. Mathematical Programming Series B 98 (2003) 23-47
15. Fischetti M., Polo C., and Scantamburlo M. A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem. Networks 44 (2004) 61-72
16. Hansen P., Mladenović N., and Urošević D. Variable neighborhood search and local branching. Computers & Operations Research 33 (2006) 3034-3045
17. Gendron B., Crainic T.G., and Frangioni A. Multicommodity capacitated network design. In: Sansó B., and Soriano P. (Eds). Telecommunications network planning (1999), Kluwer Academic Press, Norwell, MA 1-19
18. Gendron B, Crainic TG. Bounding procedures for multicommodity capacitated fixed charge network design problems. Publication CRT-96-06, Centre de recherche sur les transports, Université de Montréal; 1996.