Keyword: set covering

Found 11 papers in total
Simulating realistic set covering problems with known optimal solutions
Simulating realistic set covering problems with known optimal solutions
2011,
This paper outlines a methodology to generate random Set Covering Problem (SCP)...
Perfect, ideal and balanced matrices
Perfect, ideal and balanced matrices
2001,
In this paper, we survey results and open problems on perfect, ideal and balanced...
A comparison of algorithm RS with algorithm OPTSOL70
A comparison of algorithm RS with algorithm OPTSOL70
1997,
In a very recent paper we proposed a new lagrangian surrogate heuristic, called RS,...
Solving large set covering problems for crew scheduling
Solving large set covering problems for crew scheduling
1997,
This paper presents a computationally effective heuristic method which produces...
Improved approximation guarantees for packing and covering integer programs
Improved approximation guarantees for packing and covering integer programs
1999,
Several important NP-hard combinatorial optimization problems can be posed as...
From valid inequalities to heuristics: A unified view of primal–dual approximation algorithms in covering problems
From valid inequalities to heuristics: A unified view of primal–dual approximation algorithms in covering problems
1998,
In recent years approximation algorithms based on primal–dual methods have been...
A special class of set covering problems
A special class of set covering problems
1996,
A class of set covering problems is being introduced. This class is obtained from...
A surrogate heuristic for set covering problems
A surrogate heuristic for set covering problems
1994,
The purpose of this paper is to present a new heuristic for set covering problems,...
Solving hard set covering problems
Solving hard set covering problems
1995,
The authors propose a new branch-and-bound algorithm to solve hard instances of set...
The multicovering problem
The multicovering problem
1992,
The multicovering problem is: Min CX subject to AX≥b, X∈∈0,1∈, where...
On the minimum dummy-arc problem
On the minimum dummy-arc problem
1993,
A precedence relation can be represented non-uniquely by an activity on arc (AoA)...
Papers per page: