The convex hull of two core capacitated network design problems

DOI10.1007/BF01580612zbMath0788.90071OpenAlexW2070045881MaRDI QIDQ689128

Rita Vachani, Prakash Mirchandani, Thomas L. Magnanti

Publication date: 6 December 1993

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01580612

zbMATH Keywords

facets capacitated network design polyhedral structure

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Deterministic network models in operations research (90B10)

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, Survivable network design with shared-protection routing, A capacity scaling heuristic for the multicommodity capacitated network design problem, The robust network loading problem with dynamic routing, Robust Metric Inequalities for Network Loading Under Demand Uncertainty, Robust gateway placement in wireless mesh networks, Unsplittable non-additive capacitated network design using set functions polyhedra, Network loading problem: valid inequalities from 5- and higher partitions, Optimization in telecommunication networks, Design of survivable IP-over-optical networks, Discretized formulations for capacitated location problems with modular distribution costs, A stabilized structured Dantzig-Wolfe decomposition method, A polyhedral study of the capacity formulation of the multilayer network design problem, Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks, Revisiting Lagrangian relaxation for network design, A note on capacity models for network design, Separating tight metric inequalities by bilevel programming, Fixed charge multicommodity network design using \(p\)-partition facets, A polyhedral study of the semi-continuous knapsack problem, Bidirected and unidirected capacity installation in telecommunication networks., The splittable flow arc set with capacity and minimum load constraints, A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation, Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles, Generalized coefficient strengthening cuts for mixed integer programming, Valid inequalities for the single arc design problem with set-ups, Branch-and-price-and-cut for a service network design and hub location problem, The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs, Algorithms for the non-bifurcated network design problem, A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations, Polyhedral structure of the 4-node network design problem, The continuous knapsack set, Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design, On cut-based inequalities for capacitated network design polyhedra, 0-1 reformulations of the multicommodity capacitated network design problem, Benders Decomposition for Capacitated Network Design, A directed cycle-based column-and-cut generation method for capacitated survivable network design, Directed fixed charge multicommodity network design: a cutting plane approach using polar duality, Projections of the capacitated network loading problem, Service network design in freight transportation, Diversification strategies in local search for a nonbifurcated network loading problem, Lifting for mixed integer programs with variable upper bounds, Cover and pack inequalities for (mixed) integer programming, Continuous knapsack sets with divisible capacities

Cites Work