The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations

DOI10.1287/IJOC.1100.0380MaRDI QIDQ2899103zbMATH OpenOpenAlexFDO

Authors Ayşegül Altın, Hande Yaman, Mustafa Ç. Pınar

Publication date 28 July 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11693/21678

zbMATH Keywords

robust optimizationnetwork loading problempolyhedral demanduncertainty hose model

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Mixed integer programming (90C11)

Recommendations

• The robust network loading problem with dynamic routing
• Robust Metric Inequalities for Network Loading Under Demand Uncertainty
• A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
• Polyhedral results for the edge capacity polytope.
• Generalized hose uncertainty in single-commodity robust network design

Cited in

(16)

• Robust optimization model for a dynamic network design problem under demand uncertainty
• A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
• Telecommunications network design: Technology impacts and future directions
• A capacitated hub location problem under hose demand uncertainty
• Robust transshipment problem under consistent flow constraints
• Robust Metric Inequalities for Network Loading Under Demand Uncertainty
• Network design in scarce data environment using moment-based distributionally robust optimization
• Robust delay-constrained routing in telecommunications
• Moment-based distributionally robust joint chance constrained optimization for service network design under demand uncertainty
• Robust network design: formulations, valid inequalities, and computations
• Robust minimum cost flow problem under consistent flow constraints
• A Hybrid Polyhedral Uncertainty Model for the Robust Network Loading Problem
• Robust network design with uncertain outsourcing cost
• Generalized hose uncertainty in single-commodity robust network design
• The robust network loading problem with dynamic routing
• Affine recourse for the robust network design problem: between static and dynamic routing

Describes a project that uses

Uses Software

• MINTO

This page was built for publication: The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations

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