Near-optimal solutions to large-scale facility location problems

DOI10.1016/j.disopt.2003.03.001zbMath1140.90442OpenAlexW2100844228MaRDI QIDQ1779687

Francisco Barahona, Fabián A. Chudak

Publication date: 1 June 2005

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2003.03.001

zbMATH Keywords

Facility locationRandomized roundingVolume algorithm

Mathematics Subject Classification ID

Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Generalized average shadow prices and bottlenecks, Restructuring bank networks after mergers and acquisitions: a capacitated delocation model for closing and resizing branches, A hybrid multistart heuristic for the uncapacitated facility location problem, Agile optimization for a real‐time facility location problem in Internet of Vehicles networks, Semi-Lagrangian relaxation applied to the uncapacitated facility location problem, A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem, A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations, Observations on some heuristic methods for the capacitated facility location problem, A hybrid firefly-genetic algorithm for the capacitated facility location problem, A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access, An improved Lagrangian relaxation and dual ascent approach to facility location problems, A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem, An effective heuristic for large-scale capacitated facility location problems, Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A comparison of heuristics and relaxations for the capacitated plant location problem
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Capacitated facility location: Separation algorithms and computational experience
• The volume algorithm: Producing primal solutions with a subgradient method
• Probabilistic Analysis of a Relaxation for the k-Median Problem
• A Dual-Based Procedure for Uncapacitated Facility Location
• Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
• Validation of subgradient optimization
• Integer Programming: Methods, Uses, Computations