#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2015

2017

- This year (1)
- Last 5 years (6)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Broderick Crawford, Ricardo Soto, Natalia Berrios, Franklin Johnson, Fernando Paredes
- 2015 10th Iberian Conference on Information…
- 2015

The set covering problem belongs to the combinatorial optimization problems, whose complexity is exponential theoretically established as NP-complex problems. Consists in finding a subset of columns in a matrix of zeros and ones such that cover all rows of the matrix at minimal cost. The solution to this problem is presented using, for first time, the… (More)

- José Manuel Lanza-Gutiérrez, Broderick Crawford, Ricardo Soto, Natalia Berríos, Juan Antonio Gómez Pulido, Fernando Paredes
- Expert Syst. Appl.
- 2017

In this paper, we present a Binary cat swarm optimization for solving the Set covering problem. The Set covering problem is a well-known NP-hard problem with many practical applications, including those involving scheduling, production planning and location problems. Binary cat swarm optimization is a recent swarm metaheuristic technique based on the… (More)

- Broderick Crawford, Ricardo Soto, Natalia Berrios, Eduardo Olguı́n
- 2016

In this paper, we present a binary cat swarm optimization for solving the Set covering problem. The set covering problem is a well-known NP-hard problem with many practical applications, including those involving scheduling, production planning and location problems. Binary cat swarm optimization is a recent swarm metaheuristic technique based on the… (More)

- ‹
- 1
- ›