Pages that link to "Item:Q1779687"
From MaRDI portal
The following pages link to Near-optimal solutions to large-scale facility location problems (Q1779687):
Displaying 15 items.
- Restructuring bank networks after mergers and acquisitions: a capacitated delocation model for closing and resizing branches (Q337674) (← links)
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem (Q434153) (← links)
- Observations on some heuristic methods for the capacitated facility location problem (Q505112) (← links)
- A hybrid firefly-genetic algorithm for the capacitated facility location problem (Q508597) (← links)
- A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations (Q657059) (← links)
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- A hybrid multistart heuristic for the uncapacitated facility location problem (Q858329) (← links)
- An effective heuristic for large-scale capacitated facility location problems (Q1044245) (← links)
- Generalized average shadow prices and bottlenecks (Q1616793) (← links)
- An improved Lagrangian relaxation and dual ascent approach to facility location problems (Q1789574) (← links)
- A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem (Q1955409) (← links)
- A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access (Q2488215) (← links)
- A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem (Q2815470) (← links)
- Agile optimization for a real‐time facility location problem in Internet of Vehicles networks (Q6065907) (← links)
- RAMP experiments in solving the uncapacitated facility location problem (Q6496425) (← links)
