Enhancing an algorithm for set covering problems

This publication has 42 references indexed in Scilit:

• OR-Library: Distributing Test Problems by Electronic Mail
  Journal of the Operational Research Society, 1990
• A lagrangian heuristic for set-covering problems
  Naval Research Logistics (NRL), 1990
• On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2}
  Mathematical Programming, 1989
• A network relaxation based enumeration algorithm for set partitioning
  European Journal of Operational Research, 1989
• On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}
  Mathematical Programming, 1989
• An algorithm for solving large capacitated warehouse location problems
  European Journal of Operational Research, 1988
• An algorithm for set covering problem
  European Journal of Operational Research, 1987
• A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
  Operations Research, 1981
• Efficient Heuristic Solutions to an Airline Crew Scheduling Problem
  A I I E Transactions, 1979
• On an Integer Program for a Delivery Problem
  Operations Research, 1964