Table of Contents
Articles
| Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph | |
| G. Simonin, R. Giroudeau, B. Darties, J.-C. König | Pages 1 - 12 |
| Comparisons of Commercial MIP Solvers and an Adaptive Memory (Tabu Search) Procedure for a Class of 0-1 Integer Programming Problems | |
| Lars Magnus Hvattum, Arne Løkketangen, Fred Glover | Pages 13 - 20 |
| An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem | |
| Daniel Karapetyan, Mohammad Reihaneh | Pages 22 - 29 |
| O(m) Bound on Number of Iterations in Sphere Methods for LP | |
| Katta G. Murty | Pages 30 - 40 |
| The makespan problem of scheduling multi groups of jobs on multi processors at different speeds | |
| Wei Ding | Pages 41 - 50 |
Algorithmic Operations Research. ISSN: 1718-3235