Pages that link to "Item:Q3115938"
From MaRDI portal
The following pages link to Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation (Q3115938):
Displaying 12 items.
- Using dual feasible functions to construct fast lower bounds for routing and location problems (Q499343) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
- A column generation approach to capacitated \(p\)-median problems (Q1433151) (← links)
- A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem (Q1955409) (← links)
- Weak flow cover inequalities for the capacitated facility location problem (Q2029027) (← links)
- Dantzig-Wolfe decomposition for the facility location and production planning problem (Q2664417) (← links)
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem (Q2815470) (← links)
- An integrated <scp>user‐system</scp> approach for shelter location and evacuation routing (Q6087143) (← links)
- Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation (Q6109334) (← links)
- Scheduling-location problem with drones (Q6495369) (← links)
- A logistics provider's profit maximization facility location problem with random utility maximizing followers (Q6568468) (← links)
