Algorithmic Operations Research

Volume 7, numéro 1, spring 2012

Sommaire (4 articles) 


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