Pages that link to "Item:Q3439976"
From MaRDI portal
The following pages link to Solving the Multi-Depot Location-Routing Problem with Lagrangian Relaxation (Q3439976):
Displaying 11 items.
- A memetic algorithm for the capacitated location-routing problem with mixed backhauls (Q337427) (← links)
- An improved Lagrangian relaxation-based heuristic for a joint location-inventory problem (Q337612) (← links)
- A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem (Q879323) (← links)
- Planning a capacitated road network with flexible travel times: a genetic algorithm (Q894559) (← links)
- A survey of the standard location-routing problem (Q1698292) (← links)
- Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles (Q2292364) (← links)
- A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study (Q2404310) (← links)
- Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem (Q2815453) (← links)
- Distribution network design on the battlefield (Q3168957) (← links)
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems (Q3813590) (← links)
- Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation (Q6109334) (← links)