Single-commodity robust network design with finite and hose demand sets
DOI10.1007/S10107-016-0991-9zbMATH Open1338.90466OpenAlexW2182031487MaRDI QIDQ291071FDOQ291071
Authors: Valentina Cacchiani, Michael Jünger, F. Liers, Andrea Lodi, Daniel R. Schmidt 
Publication date: 6 June 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://e-archive.informatik.uni-koeln.de/771/1/techreport.pdf
Recommendations
- Generalized hose uncertainty in single-commodity robust network design
- Single-commodity robust network design problem: complexity, instances and heuristic solutions
- Single-commodity network design with random edge capacities
- Robust network design: formulations, valid inequalities, and computations
- The cut property under demand uncertainty
branch-and-cutcut-set inequalitiespolyhedral demand uncertaintyrobust network designseparation under uncertainty
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Mixed integer programming (90C11)
Cites Work
- Maximal Flow Through a Network
- Emergence of Scaling in Random Networks
- Reducibility among combinatorial problems
- Partitioning procedures for solving mixed-variables programming problems
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- A theorem on flows in networks
- Robust solutions of uncertain linear programs
- Robust discrete optimization and network flows
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- The convex hull of two core capacitated network design problems
- A new approach to the maximum-flow problem
- Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
- Minimum cost capacity installation for multicommodity network flows
- On implementing the push-relabel method for the maximum flow problem
- Easy and difficult objective functions for max cut
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- On capacitated network design cut-set polyhedra
- The robust network loading problem with dynamic routing
- Single-commodity robust network design problem: complexity, instances and heuristic solutions
- On cut-based inequalities for capacitated network design polyhedra
- An exact algorithm for robust network design
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Models and algorithms for robust network design with several traffic scenarios
- An Application of Generalized Linear Programming to Network Flows
- Provisioning virtual private networks under traffic uncertainty
- Hardness of robust network design
- Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements
- Designing Least-Cost Nonblocking Broadband Networks
- An exact algorithm for the min-cost network containment problem
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- Network Design Using Cut Inequalities
- Title not available (Why is that?)
- Robust solutions for network design under transportation cost and demand uncertainty
- k-Partition-based facets of the network design problem
- Synthesis of a Communication Network
- Capacitated Network Design—Polyhedral Structure and Computation
- Integer Programming and Combinatorial Optimization
- Routing of uncertain traffic demands
Cited In (16)
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
- Single-commodity robust network design problem: complexity, instances and heuristic solutions
- On the robustness of potential-based flow networks
- Identifying critical demand scenarios for the robust capacitated network design problem using principal component analysis
- Robust transshipment problem under consistent flow constraints
- Robust optimal discrete arc sizing for tree-shaped potential networks
- Network design in scarce data environment using moment-based distributionally robust optimization
- Single-commodity network design with random edge capacities
- Models and algorithms for robust network design with several traffic scenarios
- Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints
- Moment-based distributionally robust joint chance constrained optimization for service network design under demand uncertainty
- Robust minimum cost flow problem under consistent flow constraints
- Generalized hose uncertainty in single-commodity robust network design
- The cut property under demand uncertainty
- Robust flows with adaptive mitigation
- Designing networks with resiliency to edge failures using two-stage robust optimization
Uses Software
This page was built for publication: Single-commodity robust network design with finite and hose demand sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q291071)
