#### Filter Results:

- Full text PDF available (21)

#### Publication Year

2007

2018

- This year (4)
- Last 5 years (17)
- Last 10 years (29)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
- Computers & OR
- 2010

We present a diversity-oriented hybrid evolutionary approach for the graph coloring problem. This approach is based on both generally applicable strategies and specifically tailored techniques.â€¦ (More)

This paper presents an original filtering approach, called SND (Scoringbased Neighborhood Dominance), for the subgraph isomorphism problem. By reasoning on vertex dominance properties based onâ€¦ (More)

- Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
- GECCO
- 2011

We introduce the Spacing Memetic Algorithm (SMA), a formal evolutionary model devoted to a systematic control of spacing (distances) among individuals. SMA uses search space distance information toâ€¦ (More)

- Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
- Computers & OR
- 2010

We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, we introduce theâ€¦ (More)

- Philippe Galinier, Jean-Philippe Hamiez, Jin-Kao Hao, Daniel Cosmin Porumbel
- Handbook of Optimization
- 2013

- Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
- Annals OR
- 2011

The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One version of thisâ€¦ (More)

- Daniel Cosmin Porumbel
- Math. Program.
- 2016

A recurrent task in mathematical programming requires optimizing polytopes with prohibitivelymany constraints, e.g., the primal polytope in cutting-plane methods or the dual polytope in Columnâ€¦ (More)

- Daniel Cosmin Porumbel
- Discrete Optimization
- 2018

We consider a linear program over a polytope P described by prohibitively-many constraints. Given a ray direction 0 â†’ r, the intersection sub-problem asks to find: (i) the intersection point tâˆ—râ€¦ (More)

Cutting-stock and bin-packing problems have been widely studied in the operations research literature for their large range of industrial applications. Many integer programming models have beenâ€¦ (More)

- Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
- EvoCOP
- 2009

We present a hybrid evolutionary algorithm for the graph coloring problem (Evocol). Evocol is based on two simple-but-effective ideas. First, we use an enhanced crossover that collects the best colorâ€¦ (More)