Using a facility location algorithm to solve large set covering problems

DOI10.1016/0167-6377(84)90047-6zbMath0543.90084OpenAlexW2051373514MaRDI QIDQ796457

Francis J. Vasko, George R. Wilson

Publication date: 1984

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(84)90047-6

zbMATH Keywords

combinatorial optimizationheuristic algorithmset coveringlarge-scale problemsuncapacitated facility location problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Inventory, storage, reservoirs (90B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Solving large set covering problems on a personal computer, A binary cat swarm optimization algorithm for the non-unicost set covering problem, MLQCC: an improved local search algorithm for the set k‐covering problem, The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic, A binary monkey search algorithm variation for solving the set covering problem, A 3-flip neighborhood local search for the set covering problem, Surrogate constraint normalization for the set covering problem, A new approach for solving set covering problem using jumping particle swarm optimization method, A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem, A set covering approach for multi-depot train driver scheduling

Cites Work

• Unnamed Item
• An efficient heuristic for large set covering problems
• A Dual-Based Procedure for Uncapacitated Facility Location
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• A Greedy Heuristic for the Set-Covering Problem
• Worst case analysis of a class of set covering heuristics
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Computer Solutions to Minimum-Cover Problems