Respecting lower bounds in uniform lower and upper bounded facility location problem

DOI10.1007/978-3-030-89543-3_39OpenAlexW3210828199MaRDI QIDQ2695314

Neelima Gupta, Sapna Grover, Rajni Dabas

Publication date: 30 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-89543-3_39

zbMATH Keywords

upper boundsapproximationlower boundsfacility location

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A 3-approximation algorithm for the facility location problem with uniform capacities
• Approximation algorithms for the lower-bounded \(k\)-median and its generalizations
• Improved Approximation Guarantees for Lower-Bounded Facility Location
• A 5-Approximation for Capacitated Facility Location
• Analysis of a Local Search Heuristic for Facility Location Problems
• Constant factor approximation algorithm for uniform hard capacitated knapsack median problem
• On Facility Location with General Lower Bounds
• Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems
• Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts
• A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
• Algorithms - ESA 2003

This page was built for publication: Respecting lower bounds in uniform lower and upper bounded facility location problem