Pages that link to "Item:Q837097"
From MaRDI portal
The following pages link to A capacity scaling heuristic for the multicommodity capacitated network design problem (Q837097):
Displayed 17 items.
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem (Q323161) (← links)
- Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← links)
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
- A parallel local search framework for the fixed-charge multicommodity network flow problem (Q1652019) (← links)
- Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows (Q1694312) (← links)
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design (Q1754304) (← links)
- Lagrangean relaxation heuristics for the \(p\)-cable-trench problem (Q1762012) (← 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)
- A cutting plane algorithm for the capacitated connected facility location problem (Q2393652) (← links)
- Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows (Q2434985) (← links)
- Service network design models for two-tier city logistics (Q2448205) (← 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)
- A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem (Q4602333) (← links)
- MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem (Q5149549) (← links)
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)