Vol. 7 No. 1 (2012)

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

  • PDF

• 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

  • PDF

• An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem

  Daniel Karapetyan, Mohammad Reihaneh

  Pages 22 - 29

  • PDF

• O(m) Bound on Number of Iterations in Sphere Methods for LP

  Katta G. Murty

  Pages 30 - 40

  • PDF

• The makespan problem of scheduling multi groups of jobs on multi processors at different speeds

  Wei Ding

  Pages 41 - 50

  • PDF