Hao Jin-Kao

Jin-Kao Hao

Information about the author Jin-Kao Hao will soon be added to the site.
Found 16 papers in total
Path relinking for unconstrained binary quadratic programming
Path relinking for unconstrained binary quadratic programming
2012
This paper presents two path relinking algorithms to solve the unconstrained binary...
Memetic search for the max‐bisection problem
Memetic search for the max‐bisection problem
2013
Given an undirected graph G = ( V , E ) with weights on the edges, the...
Breakout Local Search for maximum clique problems
Breakout Local Search for maximum clique problems
2013
The maximum clique problem (MCP) is one of the most popular combinatorial optimization...
Coloring large graphs based on independent set extraction
Coloring large graphs based on independent set extraction
2012
This paper presents an effective approach (EXTRACOL) to coloring large graphs. The...
An effective heuristic algorithm for sum coloring of graphs
An effective heuristic algorithm for sum coloring of graphs
2012
Given an undirected graph G = ( V , E ) , the minimum sum coloring problem (MSCP) is...
Genetic Tabu search for robust fixed channel assignment under dynamic traffic data
Genetic Tabu search for robust fixed channel assignment under dynamic traffic data
2011
The contribution of this work is twofold. Firstly, we introduce a new channel...
A simple and effective algorithm for the MaxMin diversity problem
A simple and effective algorithm for the MaxMin diversity problem
2011
The challenge of maximizing the diversity of a collection of points arises in a...
Lower bounds for the ITC‐2007 curriculum‐based course timetabling problem
Lower bounds for the ITC‐2007 curriculum‐based course timetabling problem
2011
This paper describes an approach for generating lower bounds for the...
The case for strategic oscillation
The case for strategic oscillation
2011
We study a ‘hard’ optimization problem for metaheuristic search, where a...
Neighborhood analysis: a case study on curriculum‐based course timetabling
Neighborhood analysis: a case study on curriculum‐based course timetabling
2011
In this paper, we present an in‐depth analysis of neighborhood relations for...
Diversification-driven tabu search for unconstrained binary quadratic problems
Diversification-driven tabu search for unconstrained binary quadratic problems
2010
This paper describes a Diversification-Driven Tabu Search (D 2 TS) algorithm for...
Simultaneous vehicle and driver scheduling: a case study in a limousine rental company
Simultaneous vehicle and driver scheduling: a case study in a limousine rental company
2007
In this paper, we address a driver–vehicle scheduling problem in a limousine...
Generic hybrid algorithms for solving constraint satisfaction problems
Generic hybrid algorithms for solving constraint satisfaction problems
2005
In this paper, we present a generic hybrid algorithm for combining complete...
A hybrid approach to the multidimensional binary knapsack problem
A hybrid approach to the multidimensional binary knapsack problem
2001
We present in this article, a hybrid approach for solving the 0–1...
A general approach for constraint solving by local search
A general approach for constraint solving by local search
2004
In this paper, we present a general approach for solving constraint problems by local...
Upper bounds for the SPOT5 daily photograph scheduling problem
Upper bounds for the SPOT5 daily photograph scheduling problem
2003
This paper introduces tight upper bounds for the daily photograph scheduling problem...
Papers per page: