Network design arc set with variable upper bounds
From MaRDI portal
Publication:3593365
DOI10.1002/net.20162zbMath1122.90053MaRDI QIDQ3593365
Publication date: 20 July 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20162
cutting planes; network design; polyhedral structure; mixed-integer rounding; strong valid inequalities; families of strong valid inequalities; flow covers
90C35: Programming involving graphs or networks
90C11: Mixed integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B15: Stochastic network models in operations research
Related Items
Further contributions to network optimization, The continuous knapsack set, 0-1 reformulations of the multicommodity capacitated network design problem, Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut, Lifting for mixed integer programs with variable upper bounds, A note on capacity models for network design, Lifted polymatroid inequalities for mean-risk optimization with indicator variables, The splittable flow arc set with capacity and minimum load constraints
Cites Work