Pages that link to "Item:Q1338830"
From MaRDI portal
The following pages link to A polyhedral approach to multicommodity survivable network design (Q1338830):
Displayed 15 items.
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
- Design of survivable IP-over-optical networks (Q863570) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- Minimum cost capacity installation for multicommodity network flows (Q1290614) (← links)
- Economic spare capacity planning for DCS mesh-restorable networks (Q1303707) (← links)
- Exact solution of multicommodity network optimization problems with general step cost functions (Q1306346) (← links)
- A primal partitioning approach for single and non-simultaneous multicommodity flow problems (Q1569942) (← links)
- A survey on Benders decomposition applied to fixed-charge network design problems (Q1764759) (← links)
- The multi-layered network design problem (Q2370332) (← links)
- Metric inequalities and the network loading problem (Q2471279) (← links)
- A constraint generation algorithm for large scale linear programs using multiple-points separation (Q2492707) (← links)
- Optimal solution of the discrete cost multicommodity network design problem (Q2518654) (← links)
- Polyhedral structure of the 4-node network design problem (Q3057114) (← links)
- Approximation algorithms for general one-warehouse multi-retailer systems (Q5305566) (← links)
- Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité (Q5479860) (← links)