Algorithmic Operations Research

Volume 1, numéro 1, summer 2006

Sommaire (7 articles)

  1. Preface


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

Anciens numéros de Algorithmic Operations Research