Pages that link to "Item:Q3452686"
From MaRDI portal
The following pages link to A COMBINED CAPACITY SCALING AND LOCAL BRANCHING APPROACH FOR CAPACITATED MULTI-COMMODITY NETWORK DESIGN PROBLEM (Q3452686):
Displaying 9 items.
- A capacity scaling heuristic for the multicommodity capacitated network design problem (Q837097) (← links)
- A parallel local search framework for the fixed-charge multicommodity network flow problem (Q1652019) (← 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)
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design (Q2357911) (← links)
- The transit time constrained fixed charge multi-commodity network design problem (Q2669603) (← links)
- A combined capacity scaling and local branching matheuristic for the hop-constrained multicommodity network design problem (Q2825511) (← 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)
