Multiperiod network design with incremental routing

DOI10.1002/net.20171zbMath1119.90008OpenAlexW4235818304MaRDI QIDQ3593377

Benoit Lardeux, Dritan Nace, Jérôme Geffard

Publication date: 20 July 2007

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

integer programmingextreme rayspolyhedral studyincremental flowmultiperiod network design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Management decision making, including multiple objectives (90B50) Deterministic network models in operations research (90B10)

Related Items (4)

Robust network design: Formulations, valid inequalities, and computations ⋮ Multi-period traffic routing in satellite networks ⋮ Mathematical formulations for multi-period network design with modular capacity adjustments ⋮ An improved Benders decomposition applied to a multi-layer network design problem

Cites Work

• Matroids and multicommodity flows
• On the Extreme Rays of the Metric Cone
• An Efficient Heuristic Procedure for Partitioning Graphs
• Unnamed Item

This page was built for publication: Multiperiod network design with incremental routing