Pages that link to "Item:Q2489307"
From MaRDI portal
The following pages link to A first multilevel cooperative algorithm for capacitated multicommodity network design (Q2489307):
Displaying 12 items.
- Multimodal freight transportation planning: a literature review (Q297170) (← links)
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem (Q323161) (← links)
- A capacity scaling heuristic for the multicommodity capacitated network design problem (Q837097) (← links)
- A multilevel tabu search algorithm for the feature selection problem in biomedical data (Q929176) (← links)
- A local branching heuristic for the capacitated fixed-charge network design problem (Q1038297) (← 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)
- Parallel Solution Methods for Vehicle Routing Problems (Q3564355) (← links)
- A scheme for determining vehicle routes based on Arc-based service network design (Q5881488) (← links)
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)
