Algorithmic Operations Research

Volume 4, numéro 1, winter 2009

Sommaire (7 articles)


  1. Solving some Multistage Robust Decision Problems with Huge Implicitly Defined Scenario Trees
  2. Compatible Weights and Valid Cycles in Non-spanning OSPF Routing Patterns
  3. Greedy Algorithms for On-Line Set-Covering
  4. Approximated MLC shape matrix decomposition with interleaf collision constraint
  5. Robust Selling Times in Adaptive Portfolio Management
  6. General Form of a Nonmonotone Line Search Technique for Unconstrained Optimization
  7. A Solution Approach for Two-Stage Stochastic Nonlinear Mixed Integer Programs

Anciens numéros de Algorithmic Operations Research