Single-commodity robust network design with finite and hose demand sets
From MaRDI portal
(Redirected from Publication:291071)
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
Cites work
- scientific article; zbMATH DE number 1445375 (Why is no real title available?)
- A new approach to the maximum-flow problem
- A theorem on flows in networks
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- An Application of Generalized Linear Programming to Network Flows
- An exact algorithm for robust network design
- An exact algorithm for the min-cost network containment problem
- Capacitated Network Design—Polyhedral Structure and Computation
- Designing Least-Cost Nonblocking Broadband Networks
- Easy and difficult objective functions for max cut
- Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
- Emergence of Scaling in Random Networks
- Hardness of robust network design
- Integer Programming and Combinatorial Optimization
- Maximal Flow Through a Network
- Minimum cost capacity installation for multicommodity network flows
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Models and algorithms for robust network design with several traffic scenarios
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Network Design Using Cut Inequalities
- On capacitated network design cut-set polyhedra
- On cut-based inequalities for capacitated network design polyhedra
- On implementing the push-relabel method for the maximum flow problem
- Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements
- Partitioning procedures for solving mixed-variables programming problems
- Provisioning virtual private networks under traffic uncertainty
- Reducibility among combinatorial problems
- Robust discrete optimization and network flows
- Robust solutions for network design under transportation cost and demand uncertainty
- Robust solutions of uncertain linear programs
- Routing of uncertain traffic demands
- Single-commodity robust network design problem: complexity, instances and heuristic solutions
- Synthesis of a Communication Network
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- The convex hull of two core capacitated network design problems
- The robust network loading problem with dynamic routing
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- k-Partition-based facets of the network design problem
Cited in
(17)- Single-commodity network design with random edge capacities
- Models and algorithms for robust network design with several traffic scenarios
- Single-commodity robust network design problem: complexity, instances and heuristic solutions
- Robust flows with adaptive mitigation
- The cut property under demand uncertainty
- Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints
- Network design in scarce data environment using moment-based distributionally robust optimization
- Designing networks with resiliency to edge failures using two-stage robust optimization
- On the robustness of potential-based flow networks
- Robust transshipment problem under consistent flow constraints
- Robust optimal discrete arc sizing for tree-shaped potential networks
- Identifying critical demand scenarios for the robust capacitated network design problem using principal component analysis
- Moment-based distributionally robust joint chance constrained optimization for service network design under demand uncertainty
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
- Robust minimum cost flow problem under consistent flow constraints
- Capacitated network design -- multi-commodity flow formulations, cutting planes, and demand uncertainty
- Generalized hose uncertainty in single-commodity robust network design
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)
