The following pages link to (Q3840281):
Displaying 10 items.
- A local branching heuristic for the capacitated fixed-charge network design problem (Q1038297) (← links)
- A Lagrangean heuristic for the capacitated concave minimum cost network flow problem (Q1341992) (← links)
- Planning models for long-haul operations of postal and express shipment companies (Q1582188) (← links)
- A branch-and-cut algorithm for capacitated network design problems (Q1806022) (← links)
- Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound (Q2770085) (← links)
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem (Q4530653) (← links)
- A Lagrangian heuristic algorithm for the time‐dependent combined network design and routing problem (Q4565776) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900330) (← links)
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem (Q5939585) (← links)
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design (Q5946817) (← links)
