Skip to main content Skip to main navigation menu Skip to site footer
Algorithmic Operations Research
  • About
    • About the Journal
    • Editorial Team
    • Privacy Statement
  • Archives
  • Contact
Search
  • Search
  • Login
  1. Home /
  2. Archives /
  3. Vol. 1 No. 1 (2006)

Vol. 1 No. 1 (2006)

Published: 2006-01-24
  • Preface

    John R. R. Birge, Abraham Punnen
    • PDF

Articles

  • A New Practically Efficient Interior Point Method for LP

    Katta G Murty
    • PDF
  • The Abridged Nested Decomposition Method for Multistage Stochastic Linear Programs with Relatively Complete Recourse

    Christopher J. Donohue, John R. Birge
    • PDF
  • On the Stability of Approximation for Hamiltonian Path Problems

    Luca Forlizzi, Juraj Hromkovič, Guido Proietti, Sebastian Seibert
    • PDF
  • Simplex Adjacency Graphs in Linear Optimization

    Gerard Sierksma, Gert A. Tijssen
    • PDF
  • Note on Upper Bounds for TSP Domination Number

    Gregory Gutin, Angela Koller, Anders Yeo
    • PDF
  • Performance of Simulated Annealing, Tabu Search, and Evolutionary Algorithms forMulti-objective Network Partitioning

    C. Gil, R. Baños, M. G. Montoya, J. Gómez
    • PDF

Hosted by UNB Libraries | Contact
Algorithmic Operations Research

ISSN 1718-3235
Contact | Privacy Policy

More information about the publishing system, Platform and Workflow by OJS/PKP.