Algorithmic Operations Research

Volume 2, numéro 1, summer 2007

Sommaire (7 articles)


  1. Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
  2. Vertex 3-colorability of claw-free graphs
  3. Some Necessary Conditions and a General Sufficiency Condition for the Validity of A Gilmore-Gomory Type Patching Scheme for the Traveling Salesman Problem
  4. The Greedy Algorithm for the Symmetric TSP
  5. “Binarize and Project” to generate cuts for general mixed-integer programs
  6. Hybrid Continuous Interacting Ant Colony aimed at enhanced global optimization
  7. On-line Network Synthesis

Anciens numéros de Algorithmic Operations Research