Bounds and heuristics for the shortest capacitated paths problem

Journal of Heuristics

Volumn 8, Issue 4, 2002, Pages 449-465

  Costa, Marie Christine ^a   Hertz, Alain ^b   Mittaz, Michel ^b  

^a Bioinformatique et Chimie Moléculaire   (France)

^b EPFL   (Switzerland)

Author keywords

Bandwidth packing problem; Lagrangian relaxation; Minimum cost integer multicommodity flow problem; Tabu search

Indexed keywords

CONSTRAINT THEORY; GRAPH THEORY; LINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

SHORTEST CAPACITATED PATHS PROBLEMS (SCPP);

HEURISTIC METHODS;

EID: 0036644548     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1015492014030     Document Type: Article

References (21)

1. Path assignment for call routing: An application of tabu search
2. Dynamic anticipatory routing in circuit-switched telecommunications networks
3. The lagrangian relaxation method for solving integer programming problems
4. Finding a feasible course schedule using tabu search
5. A survey of linear cost multicommodity networks flows
6. Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts
7. Bandwidth packing: A tabu search approach
8. Solving multicommodity flow problems with a primal embedded network simplex algorithm
9. On the complexity of the disjoint path problem
10. Résolution des problèmes de multiflots en nombres entiers dans les grands réseaux
11. An integer programming approach to the bandwidth packing problem
12. A column generation algorithm for bandwidth packing
13. Robust taboo search for the quadratic assignment problem
14. Multicommodity flows in ring networks
15. NP-completeness of some edge-disjoint paths problem