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 33 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)
- On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems (Q721958) (← links)
- The big cube small cube solution method for multidimensional facility location problems (Q733529) (← 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)
- On solving large instances of the capacitated facility location problem (Q859676) (← links)
- Approximate solutions to large scale capacitated facility location problems (Q919754) (← links)
- A method for solving to optimality uncapacitated location problems (Q920004) (← links)
- An effective heuristic for large-scale capacitated facility location problems (Q1044245) (← links)
- An algorithm for solving large capacitated warehouse location problems (Q1099067) (← links)
- Neighborhood search heuristics for the uncapacitated facility location problem (Q1400664) (← links)
- An approximation algorithm for a large-scale facility location problem (Q1400885) (← links)
- A repeated matching heuristic for the single-source capacitated facility location problem (Q1610126) (← links)
- Generalized average shadow prices and bottlenecks (Q1616793) (← links)
- A heuristic method for large-scale multi-facility location problems (Q1765537) (← 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)
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem (Q2257610) (← links)
- Combining very large scale and ILP based neighborhoods for a two-level location problem (Q2356178) (← 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)
- A cross entropy-based metaheuristic algorithm for large-scale capacitated facility location problems (Q3161792) (← links)
- Linear relaxation solution based heuristics for a class of multi-product facility location problems (Q3307333) (← links)
- Provably near-optimal solutions for very large single-row facility layout problems (Q3396400) (← links)
- A LAGRANGEAN APPROACH TO THE FACILITY LOCATION PROBLEM WITH CONCAVE COSTS (Q3991638) (← links)
- (Q4391580) (← links)
- LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION (Q4548044) (← 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)