#### Filter Results:

- Full text PDF available (53)

#### Publication Year

1991

2019

- This year (33)
- Last 5 years (204)
- Last 10 years (266)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Eric Monfroy, Carlos Castro, Broderick Crawford
- ADVIS
- 2006

In Constraint Programming, enumeration strategies are crucial for resolution performances. The effect of strategies is generally unpredictable. In a previous work, we proposed to dynamically change… (More)

- Broderick Crawford, Ricardo Soto, Eric Monfroy, Wenceslao Palma, Carlos Castro, Fernando Paredes
- Expert Syst. Appl.
- 2013

A Constraint Satisfaction Problem is defined by a set of variables and a set of constraints, each variable has a nonempty domain of possible values. Each constraint involves some subset of the… (More)

- Broderick Crawford, Ricardo Soto, Eric Monfroy
- ICSI
- 2013

This paper addresses the solution of weighted set covering problems using cultural algorithms. The weighted set covering problem is a reasonably well known NP-complete optimization problem with many… (More)

Set covering problem is the model for many important industrial applications. In this paper, we solve some benchmarks of this problem with ant colony optimization algorithms using a new transition… (More)

- Broderick Crawford, Ricardo Soto, Miguel Olivares-Suárez, Fernando Paredes
- 9th Iberian Conference on Information Systems and…
- 2014

The set cover problem, belongs to the branch of combinatorial optimization problems, whose complexity is exponential theoretically established as NP-complex problems. Consists in finding a subset of… (More)

- Broderick Crawford, Ricardo Soto, Rodrigo Cuesta, Fernando Paredes
- TheScientificWorldJournal
- 2014

The set covering problem is a formal model for many practical optimization problems. In the set covering problem the goal is to choose a subset of the columns of minimal cost that covers every row.… (More)

- Broderick Crawford, Carlos Castro
- ICAISC
- 2006

Set Covering Problems and Set Partitioning Problems can model several real life situations. In this paper, we solve some benchmarks of them with Ant Colony Optimization algorithms and some… (More)

- Ricardo Soto, Broderick Crawford, Cristian Galleguillos, Eric Monfroy, Fernando Paredes
- Expert Syst. Appl.
- 2013

The Sudoku problem consists in filling a n^2xn^2 grid so that each column, row and each one of the nxn sub-grids contain different digits from 1 to n^2. This is a non-trivial problem, known to be… (More)

- Franklin Johnson, Broderick Crawford, Wenceslao Palma
- IFIP AI
- 2006

We present a resolution technique of the University course Timetabling problem (UCTP), this technique is based in the implementation of Hypercube framework using the Max-Min Ant System. We presented… (More)

The Set Covering Problem is a formal model for many practical optimization problems. It consists in finding a subset of columns in a zero---one matrix such that they cover all the rows of the matrix… (More)