Algorithmic Operations Research

Volume 1, numéro 1, summer 2006

Sommaire (7 articles) 



    A New Practically Efficient Interior Point Method for LP
    The Abridged Nested Decomposition Method for Multistage Stochastic Linear Programs with Relatively Complete Recourse
    On the Stability of Approximation for Hamiltonian Path Problems
    Simplex Adjacency Graphs in Linear Optimization
    Note on Upper Bounds for TSP Domination Number
    Performance of Simulated Annealing, Tabu Search, and Evolutionary Algorithms for Multi-objective Network Partitioning