Network design arc set with variable upper bounds
DOI10.1002/NET.20162zbMATH Open1122.90053OpenAlexW4236721225MaRDI QIDQ3593365FDOQ3593365
Authors: Alper Atamtürk, Oktay Günlük 
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
Recommendations
cutting planesnetwork designpolyhedral structuremixed-integer roundingstrong valid inequalitiesfamilies of strong valid inequalitiesflow covers
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11) Stochastic network models in operations research (90B15)
Cites Work
Cited In (11)
- Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
- The continuous knapsack set
- Valid inequalities for the single arc design problem with set-ups
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- A note on capacity models for network design
- Further contributions to network optimization
- Lifting for mixed integer programs with variable upper bounds
- Lifted polymatroid inequalities for mean-risk optimization with indicator variables
- Unsplittable non-additive capacitated network design using set functions polyhedra
- 0-1 reformulations of the multicommodity capacitated network design problem
- The splittable flow arc set with capacity and minimum load constraints
This page was built for publication: Network design arc set with variable upper bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593365)
