default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmic Operations Research, Volume 4
Volume 4, Number 1, 2009
- Michel Minoux:
Solving some Multistage Robust Decision Problems with Huge Implicitly Defined Scenario Trees. 1-18 - Peter Broström, Kaj Holmberg:
Compatible Weights and Valid Cycles in Non-spanning OSPF Routing Patterns. 19-35 - Giorgio Ausiello, Nicolas Bourgeois, Telis Giannakos, Vangelis Th. Paschos:
Greedy Algorithms For On-Line Set-Covering. 36-48 - Thomas Kalinowski, Antje Kiesel:
Approximated MLC shape matrix decomposition with interleaf collision constraint. 49-57 - Michael Dziecichowicz, Aurélie Thiele:
Robust Selling Times in Adaptive Portfolio Management. 58-69 - Zhensheng Yu, Ji Lin:
General Form of Nonmonotone Line Search Techniques For Unconstrained Optimization. 70-75 - Maria Elena Bruni, Patrizia Beraldi, Domenico Conforti:
A Solution Approach for Two-Stage Stochastic Nonlinear Mixed Integer Programs. 76-85
Volume 4, Number 2, 2009
- Bruno Escoffier, Martin Milanic, Vangelis Th. Paschos:
Simple and Fast Reoptimizations for the Steiner Tree Problem. 86-94 - Jérôme Palaysi, Olivier Cogis, Guillaume Bagan:
Approximable 1-Turn Routing Problems in All-Optical Mesh Networks. 95-101 - Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra:
Recoverable Robustness for Train Shunting Problems. 102-116 - Santosh N. Kabadi, R. Chandrasekaran, K. P. K. Nair:
2-Commodity Integer Network Synthesis Problem. 117-132 - Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stéphane Pérennes:
From Balls and Bins to Points and Vertices. 133-143 - Gregory Z. Gutin, Daniel Karapetyan:
Generalized Traveling Salesman Problem Reduction Algorithms. 144-154 - Renata Mansini, Ulrich Pferschy:
A Two-Period Portfolio Selection Model for Asset-backed Securitization. 155-170
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-29 21:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
