Network design arc set with variable upper bounds
From MaRDI portal
Publication:3593365
Recommendations
Cited in
(11)- Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
- Unsplittable non-additive capacitated network design using set functions polyhedra
- 0-1 reformulations of the multicommodity capacitated network design problem
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- A note on capacity models for network design
- Further contributions to network optimization
- Lifted polymatroid inequalities for mean-risk optimization with indicator variables
- The splittable flow arc set with capacity and minimum load constraints
- Valid inequalities for the single arc design problem with set-ups
- Lifting for mixed integer programs with variable upper bounds
- The continuous knapsack set
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)