Add to ORKGIl presente lavoro tratta dell'implementazione di alcuni metodi per la pre-elaborazione e la risoluzione esatta del Set Covering Problem (SCP) con tecniche di Mixed-Integer Linear Programming (MILP). Le tecniche di risoluzione, descritte negli articoli di E. Balas e A. Ho, vengono adattate per operare con un moderno risolutore MILP (CPLEX). Viene descritto anche un metodo originale per pre-elaborare le istanze di SCP
The Operations Research model known as the Set Covering Problem has a wide range of applications. Se...
The multi-objective set covering problem is a classical problem that appears in a number of real-wor...
Abstract: This paper investigates the role of dual information on the performances of heuristics des...
The set covering problem (SCP) is an NP-complete optimization problem, fitting with many problems in...
In this paper, the set covering problem (SCP) is considered. Several algorithms have been suggested ...
A metaheuristic algorithm is proposed for the solution of the Set Covering Problem. Computational re...
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper invest...
Set covering problem is a classical problem in computer science and complexity theory. It has many a...
We present a Lagrangian-based heuristic for the well-known Set Covering Problem (SCP). The algorithm...
We present a Lagrangian-based heuristic for the well-known Set Covering Problem (SCP). The main char...
The Set Covering Problem (SCP) plays an important role in Operational Research since it can be found...
This project involves solution of covering problem of set cover by genetic algorithm, which is ...
The Set Covering Problem (SCP) plays an important role in Operational Research since it can be found...
The set k-covering problem (SkCP) is a variant of the classical set covering problem (SCP), in which...
In this paper we describe the various stochastic algorithms for combinatorial optimization and then ...
The Operations Research model known as the Set Covering Problem has a wide range of applications. Se...
The multi-objective set covering problem is a classical problem that appears in a number of real-wor...
Abstract: This paper investigates the role of dual information on the performances of heuristics des...
The set covering problem (SCP) is an NP-complete optimization problem, fitting with many problems in...
In this paper, the set covering problem (SCP) is considered. Several algorithms have been suggested ...
A metaheuristic algorithm is proposed for the solution of the Set Covering Problem. Computational re...
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper invest...
Set covering problem is a classical problem in computer science and complexity theory. It has many a...
We present a Lagrangian-based heuristic for the well-known Set Covering Problem (SCP). The algorithm...
We present a Lagrangian-based heuristic for the well-known Set Covering Problem (SCP). The main char...
The Set Covering Problem (SCP) plays an important role in Operational Research since it can be found...
This project involves solution of covering problem of set cover by genetic algorithm, which is ...
The Set Covering Problem (SCP) plays an important role in Operational Research since it can be found...
The set k-covering problem (SkCP) is a variant of the classical set covering problem (SCP), in which...
In this paper we describe the various stochastic algorithms for combinatorial optimization and then ...
The Operations Research model known as the Set Covering Problem has a wide range of applications. Se...
The multi-objective set covering problem is a classical problem that appears in a number of real-wor...
Abstract: This paper investigates the role of dual information on the performances of heuristics des...