Algorithmic Operations Research

Volume 4, numéro 2, fall 2009

Sommaire (7 articles)

La lecture de ces articles nécessite une redirection vers le site de la revue.


  1. Simple and Fast Reoptimizations for the Steiner Tree Problem
  2. Approximable 1-Turn Routing Problems in All-Optical Mesh Networks
  3. Recoverable Robustness for Train Shunting Problems
  4. 2-Commodity Integer Network Synthesis Problem
  5. From Balls and Bins to Points and Vertices
  6. Generalized Traveling Salesman Problem Reduction Algorithms
  7. A Two-Period Portfolio Selection Model for Asset-backed Securitization

All rights reserved © Preeminent Academic Facets Inc., 2009

Anciens numéros de Algorithmic Operations Research