Journal: Algorithmic Operations Research

Volume 4, Issue 2

86 -- 94Bruno Escoffier, Martin Milanic, Vangelis Th. Paschos. Simple and Fast Reoptimizations for the Steiner Tree Problem
95 -- 101Jérôme Palaysi, Olivier Cogis, Guillaume Bagan. Approximable 1-Turn Routing Problems in All-Optical Mesh Networks
102 -- 116Serafino Cicerone, Gianlorenzo D Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra. Recoverable Robustness for Train Shunting Problems
117 -- 132Santosh N. Kabadi, R. Chandrasekaran, K. P. K. Nair. 2-Commodity Integer Network Synthesis Problem
133 -- 143Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stéphane Pérennes. From Balls and Bins to Points and Vertices
144 -- 154Gregory Gutin, Daniel Karapetyan. Generalized Traveling Salesman Problem Reduction Algorithms
155 -- 170Renata Mansini, Ulrich Pferschy. A Two-Period Portfolio Selection Model for Asset-backed Securitization

Volume 4, Issue 1

1 -- 18Michel Minoux. Solving some Multistage Robust Decision Problems with Huge Implicitly Defined Scenario Trees
19 -- 35Peter Broström, Kaj Holmberg. Compatible Weights and Valid Cycles in Non-spanning OSPF Routing Patterns
36 -- 48Giorgio Ausiello, Nicolas Bourgeois, Telis Giannakos, Vangelis Th. Paschos. Greedy Algorithms For On-Line Set-Covering
49 -- 57Thomas Kalinowski, Antje Kiesel. Approximated MLC shape matrix decomposition with interleaf collision constraint
58 -- 69Michael Dziecichowicz, Aurélie Thiele. Robust Selling Times in Adaptive Portfolio Management
70 -- 75Zhensheng Yu, Ji Lin. General Form of Nonmonotone Line Search Techniques For Unconstrained Optimization
76 -- 85Maria Elena Bruni, Patrizia Beraldi, Domenico Conforti. A Solution Approach for Two-Stage Stochastic Nonlinear Mixed Integer Programs