Pages that link to "Item:Q689128"
From MaRDI portal
The following pages link to The convex hull of two core capacitated network design problems (Q689128):
Displayed 15 items.
- 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)
- A capacity scaling heuristic for the multicommodity capacitated network design problem (Q837097) (← links)
- Design of survivable IP-over-optical networks (Q863570) (← 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)
- Bidirected and unidirected capacity installation in telecommunication networks. (Q1417563) (← links)
- Projections of the capacitated network loading problem (Q1577107) (← links)
- Service network design in freight transportation (Q1582187) (← links)
- Diversification strategies in local search for a nonbifurcated network loading problem (Q1848356) (← links)
- Algorithms for the non-bifurcated network design problem (Q2271128) (← links)
- Discretized formulations for capacitated location problems with modular distribution costs (Q2655611) (← links)
- Polyhedral structure of the 4-node network design problem (Q3057114) (← links)
- A directed cycle-based column-and-cut generation method for capacitated survivable network design (Q4474304) (← links)
- Optimization in telecommunication networks (Q5313481) (← links)