A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem


In this paper, approximate solutions algorithms for discrete cost multicommodity network optimization problems are presented and compared. Firstly, extensions of classical greedy heuristics, based on link-rerouting and flow-rerouting heuristics, are presented in details. Secondly, a new approximate solution algorithm, which basically consists in a heuristic… (More)
DOI: 10.1023/B:HEUR.0000004812.23590.a2


2 Figures and Tables


Citations per Year

Citation Velocity: 5

Averaging 5 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Slides referencing similar topics