Using a facility location algorithm to solve large set covering problems

DOI10.1016/0167-6377(84)90047-6MaRDI QIDQ796457zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Algorithms for large scale set covering problems
• Solving large set covering problems on a personal computer
• A large-scale application of the partial coverage uncapacitated facility location problem
• An efficient heuristic for large set covering problems
• A heuristic algorithm for the set covering problem

Cites work

• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• A Dual-Based Procedure for Uncapacitated Facility Location
• A Greedy Heuristic for the Set-Covering Problem
• An efficient heuristic for large set covering problems
• Computer Solutions to Minimum-Cover Problems
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• Worst case analysis of a class of set covering heuristics

Cited in

(13)

• A large-scale application of the partial coverage uncapacitated facility location problem
• The impact of a new formulation when solving the set covering problem using the ACO metaheuristic
• MLQCC: an improved local search algorithm for the set k‐covering problem
• A new approach for solving set covering problem using jumping particle swarm optimization method
• scientific article; zbMATH DE number 1253041 (Why is no real title available?)
• Solving large set covering problems on a personal computer
• Surrogate constraint normalization for the set covering problem
• A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem
• A binary monkey search algorithm variation for solving the set covering problem
• scientific article; zbMATH DE number 1947045 (Why is no real title available?)
• A set covering approach for multi-depot train driver scheduling
• A binary cat swarm optimization algorithm for the non-unicost set covering problem
• A 3-flip neighborhood local search for the set covering problem

This page was built for publication: Using a facility location algorithm to solve large set covering problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796457)