• Publications
  • Influence
Hybrid Evolutionary Algorithms for Graph Coloring
TLDR
A recent and very promising approach for combinatorial optimization is to embed local search into the framework of evolutionary algorithms. Expand
  • 467
  • 74
  • PDF
Transit network design and scheduling: A global review
TLDR
This paper presents a global review of the crucial strategic and tactical steps of transit planning: the design and scheduling of the network. Expand
  • 452
  • 19
  • PDF
A review on algorithms for maximum clique problems
TLDR
The maximum clique problem (MCP) is to determine in a graph a clique of maximum cardinality. Expand
  • 154
  • 16
  • PDF
Inferring gene regulatory networks from gene expression data by path consistency algorithm based on conditional mutual information
TLDR
We present a novel method for inferring GRNs from gene expression data considering the non-linear dependence and topological structure of GRNs by employing path consistency algorithm (PCA) based on conditional mutual information (CMI). Expand
  • 207
  • 15
  • PDF
A “Logic-Constrained” Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite
TLDR
The daily photograph scheduling problem of earth observation satellites such as Spot 5 consists of scheduling a subset of mono or stereo photographs from a given set of candidates to different cameras. Expand
  • 206
  • 15
  • PDF
A hybrid approach for the 0-1 multidimensional knapsack problem
TLDR
We present a hybrid approach for the 0-1 multidimensional knapsack problem. Expand
  • 158
  • 14
A memetic algorithm for graph coloring
TLDR
This paper presents a memetic algorithm (denoted by MACOL) for solving the graph coloring problem. Expand
  • 175
  • 13
  • PDF
Adaptive Tabu Search for course timetabling
TLDR
This paper presents an Adaptive Tabu Search algorithm (denoted by ATS) for solving a problem of curriculum-based course timetabling. Expand
  • 176
  • 11
  • PDF
Tabu Search for Graph Coloring, T-Colorings and Set T-Colorings
TLDR
In this paper, a generic tabu search is presented for three coloring problems: graph coloring, T-colorings and set T-colourings. Expand
  • 105
  • 10
Memetic search for the quadratic assignment problem
TLDR
BMA is able to attain the best-known results for 133 out of 135 QAP benchmark instances. Expand
  • 63
  • 10
  • PDF