Algorithmic Operations Research, Volume 1

Volume 1, Number 1, 2006

• Katta G. Murty:
  A New Practically Efficient Interior Point Method for LP.
  Electronic Edition (link) BibTeX
• Christopher J. Donohue, John R. Birge:
  The Abridged Nested Decomposition Method for Multistage Stochastic Linear Programs with Relatively Complete Recourse.
  Electronic Edition (link) BibTeX
• Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert:
  On the Stability of Approximation for Hamiltonian Path Problems.
  Electronic Edition (link) BibTeX
• Gerard Sierksma, Gert A. Tijssen:
  Simplex Adjacency Graphs in Linear Optimization.
  Electronic Edition (link) BibTeX
• Gregory Gutin, Angela Koller, Anders Yeo:
  Note on Upper Bounds for TSP Domination Number.
  Electronic Edition (link) BibTeX
• Consolación Gil, Raul Baños, Maria Dolores Gil Montoya, J. Gómez:
  Performance of Simulated Annealing, Tabu Search, and Evolutionary Algorithms for Multi-objective Network Partitioning.
  Electronic Edition (link) BibTeX

Volume 1, Number 2, 2006

• Ralf Klasing, Christian Laforest, Joseph Peters, Nicolas Thibault:
  Constructing Incremental Sequences in Graphs.
  Electronic Edition (link) BibTeX
• Gregory Gutin, Tommy R. Jensen, Anders Yeo:
  On-line bin Packing with Two Item Sizes.
  Electronic Edition (link) BibTeX
• Francis Sourd:
  Preemptive Scheduling with Position Costs.
  Electronic Edition (link) BibTeX
• Walid Ben-Ameur, Adam Ouorou:
  Mathematical Models of the Delay Constrained Routing Problem.
  Electronic Edition (link) BibTeX
• Saswati Tripathi, Bhawna Minocha:
  Vehicle Routing Problem with Time Windows: An Evolutionary Algorithmic Approach.
  Electronic Edition (link) BibTeX