Pages that link to "Item:Q5287444"
From MaRDI portal
The following pages link to Shortest paths, single origin‐destination network design, and associated polyhedra (Q5287444):
Displaying 25 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)
- Polyhedral results on single node variable upper-bound flow models with allowed configurations (Q865750) (← 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)
- Source sink flows with capacity installation in batches (Q1130180) (← links)
- Cutting planes for integer programs with general integer variables (Q1290616) (← links)
- Optimal placement of add/drop multiplexers: Static and dynamic models (Q1295992) (← links)
- Exact solution of multicommodity network optimization problems with general step cost functions (Q1306346) (← links)
- A suboptimal solution to a hierarchical network design problem using dynamic programming (Q1388941) (← links)
- Bidirected and unidirected capacity installation in telecommunication networks. (Q1417563) (← links)
- Projections of the capacitated network loading problem (Q1577107) (← links)
- One and two facility network design revisited (Q1610880) (← links)
- Facets for single module and multi-module capacitated lot-sizing problems without backlogging (Q1727732) (← links)
- A survey on Benders decomposition applied to fixed-charge network design problems (Q1764759) (← links)
- Diversification strategies in local search for a nonbifurcated network loading problem (Q1848356) (← links)
- A note on capacity models for network design (Q2417179) (← links)
- Perspective reformulations of mixed integer nonlinear programs with indicator variables (Q2638370) (← links)
- Polyhedral structure of the 4-node network design problem (Q3057114) (← 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)
- Algorithms and extended formulations for one and two facility network design (Q4645912) (← links)
- On dependent randomized rounding algorithms (Q4645933) (← links)
- Robust network design: Formulations, valid inequalities, and computations (Q5326784) (← links)
- Valid inequalities and facets for multi‐module survivable network design problem (Q6179709) (← links)
