A surrogate heuristic for set covering problems
Authors:
- Luiz Antonio N. LorenaLLLuiz Antonio N. Lorena
- Fábio Belo LopesFLFábio Belo Lopes
- 1 November 1994
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 79 (1) , 138-150
Abstract
No abstract availableKeywords
This publication has 40 references indexed in Scilit:
- Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering ProblemsJournal of the Operational Research Society, 1988
- A Starter Kit for Micro-Based L.P. SolversJournal of the Operational Research Society, 1985
- Linear Programming Applications on MicrocomputersJournal of the Operational Research Society, 1985
- Network Analysis on a MicroJournal of the Operational Research Society, 1985
- Forecasting and Inventory Control on MicrosJournal of the Operational Research Society, 1985
- An efficient heuristic for large set covering problemsNaval Research Logistics Quarterly, 1984
- Exact solution of crew scheduling problems using the set partitioning model: Recent successful applicationsNetworks, 1981
- An Integer Programming Approach to the Vehicle Scheduling ProblemJournal of the Operational Research Society, 1976
- Set Covering by an All Integer AlgorithmJournal of the ACM, 1973
- A Way to Simplify Truth FunctionsThe American Mathematical Monthly, 1955