Pages that link to "Item:Q4474304"
From MaRDI portal
The following pages link to A directed cycle-based column-and-cut generation method for capacitated survivable network design (Q4474304):
Displaying 8 items.
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems (Q316168) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles (Q951116) (← links)
- Intersection cuts for single row corner relaxations (Q1621696) (← links)
- Polyhedral structure of the 4-node network design problem (Q3057114) (← links)
- Optimal Network Design with End-to-End Service Requirements (Q4604906) (← links)
- Valid inequalities and facets for multi‐module survivable network design problem (Q6179709) (← links)
- Robust capacitated Steiner trees and networks with uniform demands (Q6179720) (← links)
