The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations
From MaRDI portal
Publication:2899103
DOI10.1287/ijoc.1100.0380zbMath1243.90028OpenAlexW2088005539MaRDI QIDQ2899103
Hande Yaman, Ayşegül Altın, Mustafa Çelebi Pinar
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
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items
The robust network loading problem with dynamic routing, Robust Metric Inequalities for Network Loading Under Demand Uncertainty, Robust Network Design with Uncertain Outsourcing Cost, Network design in scarce data environment using moment-based distributionally robust optimization, A capacitated hub location problem under hose demand uncertainty, Robust delay-constrained routing in telecommunications, Robust network design: Formulations, valid inequalities, and computations, Affine recourse for the robust network design problem: Between static and dynamic routing, Robust minimum cost flow problem under consistent flow constraints, Telecommunications network design: Technology impacts and future directions, Robust transshipment problem under consistent flow constraints, A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
Uses Software
