Pages that link to "Item:Q1849499"
From MaRDI portal
The following pages link to On capacitated network design cut-set polyhedra (Q1849499):
Displaying 48 items.
- Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
- Single-commodity robust network design problem: complexity, instances and heuristic solutions (Q296864) (← links)
- Survivable network design with shared-protection routing (Q296897) (← links)
- Unsplittable non-additive capacitated network design using set functions polyhedra (Q342169) (← links)
- Solving survivable two-layer network design problems by metric inequalities (Q429456) (← links)
- Benders, metric and cutset inequalities for multicommodity capacitated network design (Q632387) (← links)
- The convex hull of two core capacitated network design problems (Q689128) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Lifting two-integer knapsack inequalities (Q868448) (← links)
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles (Q951116) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- Submodularity and valid inequalities in capacitated fixed charge networks (Q1121763) (← links)
- A characterization of the uncapacitated network design polytope (Q1200785) (← links)
- On splittable and unsplittable flow capacitated network design arc-set polyhedra. (Q1611009) (← links)
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
- New exact solution approaches for the split delivery vehicle routing problem (Q1742903) (← links)
- Valid inequalities for the single arc design problem with set-ups (Q1751105) (← links)
- Multi-commodity variable upper bound flow models (Q1751124) (← links)
- Convex hull results for the warehouse problem (Q1756347) (← links)
- Separating tight metric inequalities by bilevel programming (Q1939716) (← links)
- Convex hull results for generalizations of the constant capacity single node flow set (Q2020609) (← links)
- An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron (Q2052386) (← links)
- A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations (Q2275582) (← links)
- Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut (Q2299984) (← links)
- Approximability of capacitated network design (Q2354026) (← links)
- A note on capacity models for network design (Q2417179) (← links)
- Metric inequalities and the network loading problem (Q2471279) (← links)
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
- A note on the selection of Benders' cuts (Q2638375) (← links)
- A robust optimization model for distribution network design under a mixed integer set of scenarios (Q2669596) (← links)
- Convex Relaxations for Gas Expansion Planning (Q2960359) (← links)
- Polyhedral structure of the 4-node network design problem (Q3057114) (← links)
- On cut-based inequalities for capacitated network design polyhedra (Q3082603) (← links)
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (Q3404461) (← links)
- Network design arc set with variable upper bounds (Q3593365) (← links)
- A directed cycle-based column-and-cut generation method for capacitated survivable network design (Q4474304) (← links)
- Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling (Q5129179) (← links)
- MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem (Q5149549) (← links)
- Optimization in telecommunication networks (Q5313481) (← links)
- Robust network design: Formulations, valid inequalities, and computations (Q5326784) (← links)
- Affine recourse for the robust network design problem: Between static and dynamic routing (Q5326787) (← links)
- Benders decomposition approach for the robust network design problem with flow bifurcations (Q5326799) (← links)
- A polyhedral study of the capacity formulation of the multilayer network design problem (Q5326800) (← links)
- Algorithms – ESA 2005 (Q5475818) (← links)
- Capacitated Network Design—Polyhedral Structure and Computation (Q5690264) (← links)
- Valid inequalities and facets for multi‐module survivable network design problem (Q6179709) (← links)
