Two new heuristics for the location set covering problem

DOI10.1007/BF02574812zbMath0826.90091MaRDI QIDQ1893520

Jesus T. Pastor, Marcos Almiñana

Publication date: 4 July 1995

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

location set coveringgreedy-type heuristics

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items (3)

A comparison of algorithm RS with algorithm OPTSOL70 ⋮ Siting of HIV/AIDS diagnostic equipment in South Africa: a case study in locational analysis ⋮ An adaptation of SH heuristic to the location set covering problem

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Review, extension and prediction in emergency service siting models
• An efficient heuristic for large set covering problems
• Hybrid heuristics for minimum cardinality set covering problems
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• Worst case analysis of a class of set covering heuristics
• Computer Solutions to Minimum-Cover Problems
• The Location of Emergency Service Facilities

This page was built for publication: Two new heuristics for the location set covering problem