Pages that link to "Item:Q5926334"
From MaRDI portal
The following pages link to Strong inequalities for capacitated survivable network design problems. (Q5926334):
Displaying 15 items.
- Survivable network design with shared-protection routing (Q296897) (← links)
- Unsplittable non-additive capacitated network design using set functions polyhedra (Q342169) (← links)
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles (Q951116) (← links)
- A polyhedral approach to multicommodity survivable network design (Q1338830) (← links)
- Valid inequalities and separation for capacitated fixed charge flow problems (Q1962074) (← links)
- Single-Sink Multicommodity Flow with Side Constraints (Q2971620) (← links)
- Polyhedral structure of the 4-node network design problem (Q3057114) (← links)
- On cut-based inequalities for capacitated network design polyhedra (Q3082603) (← links)
- Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction (Q3386769) (← links)
- A directed cycle-based column-and-cut generation method for capacitated survivable network design (Q4474304) (← links)
- (Q5020877) (← links)
- Models and Algorithms for Intermodal Transportation and Equipment Selection (Q5176321) (← links)
- Information security: Designing a stochastic-network for throughput and reliability (Q5305565) (← 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)
