Pages that link to "Item:Q5712458"
From MaRDI portal
The following pages link to Integer Programming and Combinatorial Optimization (Q5712458):
Displaying 8 items.
- Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
- Solving survivable two-layer network design problems by metric inequalities (Q429456) (← links)
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles (Q951116) (← links)
- Projections of the capacitated network loading problem (Q1577107) (← links)
- Network loading problem: valid inequalities from 5- and higher partitions (Q1654355) (← links)
- Metric inequalities and the network loading problem (Q2471279) (← links)
- Using mixed-integer programming to solve power grid blackout problems (Q2471280) (← links)
- Robust Metric Inequalities for Network Loading Under Demand Uncertainty (Q3455882) (← links)