Pages that link to "Item:Q2770085"

The following pages link to Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound (Q2770085):

Displayed 8 items.

• Scatter search for network design problem (Q817138) ‎ (← links)
• Traffic engineering of tunnel-based networks with class specific diversity requirements (Q857786) ‎ (← links)
• Hybrid meta-heuristic algorithms for solving network design problem (Q881517) ‎ (← links)
• A Lagrangean heuristic for the facility location problem with staircase costs (Q1278582) ‎ (← links)
• Service network design in freight transportation (Q1582187) ‎ (← links)
• Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths (Q2469589) ‎ (← links)
• Network design and flow problems with cross-arc costs (Q2482771) ‎ (← links)
• Memetic algorithms (Q2573010) ‎ (← links)