Restricted access to the most recent articles in subscription journals was reinstated on January 12, 2021. These articles can be consulted through the digital resources portal of one of Érudit's 1,200 partner institutions or subscribers. More informations

Algorithmic Operations Research

Volume 7, Number 1, Spring 2012

Table of contents (4 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

Back issues of Algorithmic Operations Research