Near-optimal solutions to large-scale facility location problems
type: Item
instance of: scholarly article
title: Near-optimal solutions to large-scale facility location problems
zbMATH Open document ID: 1140.90442
author: Francisco Barahona
author: F. Chudak
published in: Discrete Optimization
publication date: 2005-06-01T00:00:00Z
Mathematics Subject Classification ID: 90B85
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2173495
zbMATH Keywords: Volume algorithm
zbMATH Keywords: Randomized rounding
zbMATH Keywords: Facility location
MaRDI profile type: Publication
full work available at URL: j.disopt.2003.03.001
OpenAlex ID: W2100844228
cites work: Capacitated facility location: Separation algorithms and computational experience
cites work: Probabilistic Analysis of a Relaxation for the k-Median Problem
cites work: Integer Programming: Methods, Uses, Computations
cites work: The volume algorithm: Producing primal solutions with a subgradient method
cites work: Q3840357
cites work: Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
cites work: Q3351135
cites work: A comparison of heuristics and relaxations for the capacitated plant location problem
cites work: A Dual-Based Procedure for Uncapacitated Facility Location
cites work: Validation of subgradient optimization
cites work: Q4040780
cites work: Q3993417
cites work: Randomized rounding: A technique for provably good algorithms and algorithmic proofs
cites work: Q4526991
cites work: Q4146571
DOI: 10.1016/J.DISOPT.2003.03.001
description: scientific article; zbMATH DE number 2173495