Algorithmic Operations Research

Volume 2, numéro 1, summer 2007

Sommaire (7 articles) 


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