Near-optimal solutions to large-scale facility location problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1560330
- Approximate solutions to large scale capacitated facility location problems
- An effective heuristic for large-scale capacitated facility location problems
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- On solving large instances of the capacitated facility location problem
Cites work
- scientific article; zbMATH DE number 4202014 (Why is no real title available?)
- scientific article; zbMATH DE number 1187151 (Why is no real title available?)
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- scientific article; zbMATH DE number 193993 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- A Dual-Based Procedure for Uncapacitated Facility Location
- A comparison of heuristics and relaxations for the capacitated plant location problem
- Capacitated facility location: Separation algorithms and computational experience
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Integer Programming: Methods, Uses, Computations
- Probabilistic Analysis of a Relaxation for the k-Median Problem
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- The volume algorithm: Producing primal solutions with a subgradient method
- Validation of subgradient optimization
Cited in
(36)- Combining very large scale and ILP based neighborhoods for a two-level location problem
- An effective heuristic for large-scale capacitated facility location problems
- A method for solving to optimality uncapacitated location problems
- A LAGRANGEAN APPROACH TO THE FACILITY LOCATION PROBLEM WITH CONCAVE COSTS
- An approximation algorithm for a large-scale facility location problem
- Generalized average shadow prices and bottlenecks
- scientific article; zbMATH DE number 1560330 (Why is no real title available?)
- Agile optimization for a real‐time facility location problem in Internet of Vehicles networks
- A hybrid multistart heuristic for the uncapacitated facility location problem
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
- A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations
- The big cube small cube solution method for multidimensional facility location problems
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
- A heuristic method for large-scale multi-facility location problems
- RAMP experiments in solving the uncapacitated facility location problem
- Approximate solutions to large scale capacitated facility location problems
- Practical techniques to solve capacitated facility location problem
- A repeated matching heuristic for the single-source capacitated facility location problem
- Provably near-optimal solutions for very large single-row facility layout problems
- An improved Lagrangian relaxation and dual ascent approach to facility location problems
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem
- Neighborhood search heuristics for the uncapacitated facility location problem
- A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access
- On solving large instances of the capacitated facility location problem
- An algorithm for solving large capacitated warehouse location problems
- Linear relaxation solution based heuristics for a class of multi-product facility location problems
- A cross entropy-based metaheuristic algorithm for large-scale capacitated facility location problems
- On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems
- A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem
- Lagrangian heuristics for large-scale dynamic facility location with generalized modular capacities
- LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
- Observations on some heuristic methods for the capacitated facility location problem
- A hybrid firefly-genetic algorithm for the capacitated facility location problem
- Restructuring bank networks after mergers and acquisitions: a capacitated delocation model for closing and resizing branches
- scientific article; zbMATH DE number 1159167 (Why is no real title available?)
This page was built for publication: Near-optimal solutions to large-scale facility location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1779687)
