Multicommodity Flow Requirements

  • Christelle Wynants
Part of the Combinatorial Optimization book series (COOP, volume 8)


In this chapter we consider the minimum network synthesis problem with non-simultaneous multicommodity flow requirements when both edge capacities and flows are required to be integer. Since exact methods cannot currently solve realistic sized instances of this problem, we have developed a tabu search heuristic to find good feasible solutions in reasonable time.


Tabu Search Lagrangean Relaxation Tabu List Greedy Heuristic Linear Relaxation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2001

Authors and Affiliations

  • Christelle Wynants
    • 1
  1. 1.Service de Mathématiques de la Gestion, Institut de Statistique et de Recherche OpérationnelleUniversité Libre de BruxellesBrusselsBelgium

Personalised recommendations