The following pages link to Algorithms – ESA 2005 (Q5475818):
Displayed 14 items.
- Benders, metric and cutset inequalities for multicommodity capacitated network design (Q632387) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design (Q1754304) (← links)
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design (Q2064301) (← links)
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality (Q2077967) (← links)
- Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure (Q2147939) (← links)
- Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
- Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion (Q2292358) (← links)
- A cutting plane algorithm for the capacitated connected facility location problem (Q2393652) (← links)
- Revisiting Lagrangian relaxation for network design (Q2414466) (← links)
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
- The transit time constrained fixed charge multi-commodity network design problem (Q2669603) (← links)
- Exact algorithms for the vertex separator problem in graphs (Q3008917) (← links)