Multiperiod network design with incremental routing

DOI10.1002/NET.20171zbMATH Open1119.90008OpenAlexW4235818304MaRDI QIDQ3593377FDOQ3593377

Authors: 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

Recommendations

• Incremental network design with maximum flows
• Incremental network design with shortest paths
• Combined Network Design and Multiperiod Pricing: Modeling, Solution Techniques, and Computation
• scientific article; zbMATH DE number 3906198
• The multi-layered network design problem

zbMATH Keywords

integer programmingpolyhedral studyextreme raysincremental flowmultiperiod network design

Mathematics Subject Classification ID

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

Cites Work

• An Efficient Heuristic Procedure for Partitioning Graphs
• Matroids and multicommodity flows
• On the Extreme Rays of the Metric Cone
• Title not available (Why is that?)

Cited In (6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593377)