4.2 Article

The facility location problem with maximum distance constraint

Related references

Note: Only part of the references are listed.
Article Computer Science, Interdisciplinary Applications

An approximation algorithm for stochastic multi-level facility location problem with soft capacities

Chenchen Wu et al.

Summary: This paper discusses the multi-level facility location problem in uncertain scenarios and proposes an approximation algorithm. The algorithm simplifies the problem with soft capacities to SMLFLP and solves the SMLFLP problem with an approximation approach.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2022)

Article Computer Science, Theory & Methods

Approximation algorithms for the dynamic k-level facility location problems

Limin Wang et al.

Summary: This paper investigates a dynamic k-level facility location problem and proposes a combinatorial primal-dual approximation algorithm, as well as two constant factor approximation algorithms for the dynamic problem with submodular penalties and outliers.

THEORETICAL COMPUTER SCIENCE (2021)

Article Operations Research & Management Science

An approximation algorithm for the k-level facility location problem with outliers

Lu Han et al.

Summary: This paper studies the k-level facility location problem with outliers and proposes a 6-approximation algorithm based on primal-dual technique. The goal is to minimize the total cost of connecting clients to facilities of different levels.

OPTIMIZATION LETTERS (2021)

Article Computer Science, Theory & Methods

LP-BASED ALGORITHMS FOR CAPACITATED FACILITY LOCATION

Hyung-Chan An et al.

SIAM JOURNAL ON COMPUTING (2017)

Article Mathematics, Applied

An Improved Approximation Algorithm for the k-Level Facility Location Problem with Soft Capacities

Chen-chen Wu et al.

ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES (2017)

Article Computer Science, Software Engineering

Improved Approximation Algorithms for the Facility Location Problems with Linear/Submodular Penalties

Yu Li et al.

ALGORITHMICA (2015)

Article Computer Science, Theory & Methods

A 1.488 approximation algorithm for the uncapacitated facility location problem

Shi Li

INFORMATION AND COMPUTATION (2013)

Article Computer Science, Software Engineering

A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties

Donglei Du et al.

ALGORITHMICA (2012)

Article Mathematics, Applied

Path relinking approach for multiple allocation hub maximal covering problem

Bo Qu et al.

COMPUTERS & MATHEMATICS WITH APPLICATIONS (2009)

Article Computer Science, Interdisciplinary Applications

An improved approximation algorithm for uncapacitated facility location problem with penalties

Guang Xu et al.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2009)

Article Computer Science, Software Engineering

Hedging uncertainty: Approximation algorithms for stochastic optimization problems

R. Ravi et al.

MATHEMATICAL PROGRAMMING (2006)

Article Computer Science, Theory & Methods

Approximation algorithms for metric facility location problems

Mohammad Mahdian et al.

SIAM JOURNAL ON COMPUTING (2006)

Article Operations Research & Management Science

A multiexchange local search algorithm for the capacitated facility location problem

JW Zhang et al.

MATHEMATICS OF OPERATIONS RESEARCH (2005)

Article Computer Science, Software Engineering

Improved approximation algorithms for capacitated facility location problems

FA Chudak et al.

MATHEMATICAL PROGRAMMING (2005)

Article Computer Science, Theory & Methods

Local search heuristics for k-median and facility location problems

V Arya et al.

SIAM JOURNAL ON COMPUTING (2004)

Article Computer Science, Theory & Methods

Improved approximation algorithms for the uncapacitated facility location problem

FA Chudak et al.

SIAM JOURNAL ON COMPUTING (2003)