#### Filter Results:

- Full text PDF available (14)

#### Publication Year

2000

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jean-Philippe Hamiez, Jin-Kao Hao
- Artificial Evolution
- 2001

- Yan Jin, Jean-Philippe Hamiez, Jin-Kao Hao
- Artificial Intelligence Review
- 2016

The minimum sum coloring problem (MSCP) is a variant of the well-known vertex coloring problem which has a number of AI related applications. Due to its theoretical and practical relevance, MSCP attracts increasing attention. The only existing review on the problem dates back to 2004 and mainly covers the history of MSCP and theoretical developments on… (More)

- Jean-Philippe Hamiez, Jin-Kao Hao, Fred Glover
- Int. J. of Applied Metaheuristic Computing
- 2010

The authors present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper 3-colorings for random 3-colorable graphs with up to 11000 vertices and beyond when instances follow the uniform or equipartite well-known models, and up to 1500 vertices… (More)

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

Graph vertex coloring is one of the most studied NP-hard combinatorial optimization problems. Given the hardness of the problem, various heuristic algorithms have been proposed for practical graph coloring, based on local search, population-based approaches and hybrid methods. The research in graph coloring heuristics is very active and improved results… (More)

- Yan Jin, Jin-Kao Hao, Jean-Philippe Hamiez
- Computers & OR
- 2014

Given an undirected graph G, the Minimum Sum Coloring Problem (MSCP) is to find a legal assignment of colors (represented by natural numbers) to each vertex of G such that the total sum of the colors assigned to the vertices is minimized. This paper presents a memetic algorithm for MSCP based on a tabu search procedure with two neighborhoods and a… (More)

- Jean-Philippe Hamiez, Jin-Kao Hao
- ArXiv
- 2014

Sports league scheduling is a difficult task in the general case. In this short note, we report two improvements to an existing enumerative search algorithm for a NP-hard sports league scheduling problem known as “prob026” in CSPLib. These improvements are based on additional rules to constraint and accelerate the enumeration process. The proposed approach… (More)

- Jean-Philippe Hamiez, Jin-Kao Hao
- Local Search for Planning and Scheduling
- 2000

In this paper we present a tabu approach for a version of the Sports League Scheduling Problem. The approach adopted is based on a formulation of the problem as a Constraint Satisfaction Problem (CSP). Tests were carried out on problem instances of up to 40 teams representing 780 integer variables with 780 values per variable. Experimental results show that… (More)

- Jean-Philippe Hamiez, Jin-Kao Hao
- Discrete Applied Mathematics
- 2004

In this paper, we present a repair-based linear-time algorithm to solve a version of the Sports League Scheduling Problem (SLSP) where the number T of teams is such that (T − 1)mod 3 = 0. Starting with a con6icting schedule with particular properties, the algorithm removes iteratively the con6icts by exchanging matches. The properties of the initial… (More)

- Jean-Philippe Hamiez, Julien Robet, Jin-Kao Hao
- EvoCOP
- 2009

This paper introduces a new tabu search algorithm for a twodimensional (2D) Strip Packing Problem (2D-SPP). It integrates several key features: A direct representation of the problem, a satisfaction-based solving scheme, two different complementary neighborhoods, a diversification mechanism and a particular tabu structure. The representation allows… (More)

- Jean-Philippe Hamiez, Jin-Kao Hao
- Discrete Applied Mathematics
- 2008

This paper presents an enumerative approach for a particular sports league scheduling problem known as “Prob026” in CSPLib. Despite its exponential-time complexity, this simple method can solve all instances involving a number T of teams up to 50 in a reasonable amount of time while the best known tabu search and constraint programming algorithms are… (More)