Pages that link to "Item:Q2299984"
From MaRDI portal
The following pages link to Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut (Q2299984):
Displaying 6 items.
- A characterization of the uncapacitated network design polytope (Q1200785) (← links)
- An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes (Q1994496) (← links)
- An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron (Q2052386) (← links)
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (Q3404461) (← links)
- A polyhedral analysis of the capacitated edge activation problem with uncertain demands (Q5194730) (← links)
- A polyhedral study of the capacity formulation of the multilayer network design problem (Q5326800) (← links)
