Pages that link to "Item:Q1939716"
From MaRDI portal
The following pages link to Separating tight metric inequalities by bilevel programming (Q1939716):
Displayed 9 items.
- Energy-aware survivable networks (Q325416) (← links)
- Bilevel programming and the separation problem (Q403662) (← links)
- Network loading problem: valid inequalities from 5- and higher partitions (Q1654355) (← links)
- Fixed charge multicommodity network design using \(p\)-partition facets (Q1698889) (← links)
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation (Q1744909) (← links)
- The robust network loading problem with dynamic routing (Q2377165) (← links)
- Benders Decomposition for Capacitated Network Design (Q2835663) (← links)
- An exact approach for the multicommodity network optimization problem with a step cost function (Q5244303) (← links)
- A polyhedral study of the capacity formulation of the multilayer network design problem (Q5326800) (← links)