An adaptation of SH heuristic to the location set covering problem

DOI10.1016/S0377-2217(96)00181-6zbMath0920.90087MaRDI QIDQ1278140

Marcos Almiñana, Jesus T. Pastor

Publication date: 22 February 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

location set covering; surrogate relaxation; surrogate heuristic

Mathematics Subject Classification ID

90C27: Combinatorial optimization

90B80: Discrete location and assignment

Related Items

A GRASP algorithm to solve the unicost set covering problem, Surrogate constraint normalization for the set covering problem, A comparison of algorithm RS with algorithm OPTSOL70, A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem, Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enhancing an algorithm for set covering problems
• A Lagrangian-based heuristic for large-scale set covering problems
• Algorithms for large scale set covering problems
• A surrogate heuristic for set covering problems
• An algorithm for set covering problem
• Two new heuristics for the location set covering problem
• An efficient heuristic for large set covering problems
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• Hybrid heuristics for minimum cardinality set covering problems
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations
• A heuristic algorithm for the set covering problem
• Discrete-Variable Extremum Problems
• Computer Solutions to Minimum-Cover Problems
• The Location of Emergency Service Facilities
• Surrogate Mathematical Programming