A Lagrangian heuristic algorithm for the time‐dependent combined network design and routing problem

DOI10.1002/net.21721zbMath1390.90159OpenAlexW2550411532WikidataQ115150494 ScholiaQ115150494MaRDI QIDQ4565776

Bernard Fortz, Enrico Gorgone, Dimitri Papadimitriou

Publication date: 13 June 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21721

zbMATH Keywords

mixed integer programmingLagrangian decompositionnetwork designroutingtelecommunications networksmulticommodity fixed-charge network design

Mathematics Subject Classification ID

Mixed integer programming (90C11) Communication networks in operations research (90B18)

Related Items

Lagrangian relaxation for SVM feature selection, The invisible‐hand heuristic for origin‐destination integer multicommodity network flows, Models for the piecewise linear unsplittable multicommodity flow problems