On capacitated network design cut-set polyhedra
From MaRDI portal
Publication:1849499
DOI10.1007/s101070100284zbMath1008.90003OpenAlexW2114587443MaRDI QIDQ1849499
Publication date: 1 December 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070100284
Related Items
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design, Single-commodity robust network design with finite and hose demand sets, Single-commodity robust network design problem: complexity, instances and heuristic solutions, Survivable network design with shared-protection routing, A note on the selection of Benders' cuts, Unsplittable non-additive capacitated network design using set functions polyhedra, Optimization in telecommunication networks, Lifting two-integer knapsack inequalities, Robust network design: Formulations, valid inequalities, and computations, Affine recourse for the robust network design problem: Between static and dynamic routing, Benders decomposition approach for the robust network design problem with flow bifurcations, A polyhedral study of the capacity formulation of the multilayer network design problem, A robust optimization model for distribution network design under a mixed integer set of scenarios, A note on capacity models for network design, Separating tight metric inequalities by bilevel programming, Convex Relaxations for Gas Expansion Planning, Valid inequalities and facets for multi‐module survivable network design problem, Benders, metric and cutset inequalities for multicommodity capacitated network design, Solving survivable two-layer network design problems by metric inequalities, Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling, MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem, New exact solution approaches for the split delivery vehicle routing problem, Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles, Metric inequalities and the network loading problem, Multi-commodity variable upper bound flow models, Convex hull results for the warehouse problem, Cutting planes in integer and mixed integer programming, The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs, Convex hull results for generalizations of the constant capacity single node flow set, A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations, Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design, Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut, On cut-based inequalities for capacitated network design polyhedra, An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron, 0-1 reformulations of the multicommodity capacitated network design problem, Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems, A directed cycle-based column-and-cut generation method for capacitated survivable network design, Approximability of capacitated network design, Cover and pack inequalities for (mixed) integer programming
