Pages that link to "Item:Q1849499"
From MaRDI portal
The following pages link to On capacitated network design cut-set polyhedra (Q1849499):
Displayed 15 items.
- Solving survivable two-layer network design problems by metric inequalities (Q429456) (← links)
- Benders, metric and cutset inequalities for multicommodity capacitated network design (Q632387) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Lifting two-integer knapsack inequalities (Q868448) (← links)
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles (Q951116) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations (Q2275582) (← links)
- Metric inequalities and the network loading problem (Q2471279) (← links)
- A note on the selection of Benders' cuts (Q2638375) (← links)
- On cut-based inequalities for capacitated network design polyhedra (Q3082603) (← links)
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (Q3404461) (← links)
- A directed cycle-based column-and-cut generation method for capacitated survivable network design (Q4474304) (← links)
- Optimization in telecommunication networks (Q5313481) (← links)