Algorithmic Operations Research

Volume 7, numéro 1, spring 2012

Sommaire (4 articles)

La lecture de ces articles nécessite une redirection vers le site de la revue.

Articles

  1. Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph
  2. Comparisons of Commercial MIP Solvers and an Adaptive Memory (Tabu Search) Procedure for a Class of 0–1 Integer Programming Problems
  3. An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem
  4. The makespan problem of scheduling multi groups of jobs on multi processors at different speeds

All rights reserved © Preeminent Academic Facets Inc., 2012