default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmic Operations Research, Volume 5
Volume 5, Number 1, 2010
- Tibor Illés, Marianna Nagy, Tamás Terlaky:
Polynomial Interior Point Algorithms for General Linear Complementarity Problems. 1-12 - Federico Della Croce, Vangelis Th. Paschos, Roberto Wolfler Calvo:
Approximating the metric 2-Peripatetic Salesman Problem. 13-20 - Katta G. Murty, Mohammad R. Oskoorouchi:
Sphere Methods for LP. 21-33 - Wei Ding, Yi Zhao:
An improved LS algorithm for the problem of scheduling multi groups of jobs on multi processors at the same speed. 34-38 - Seyed Ahmad Hosseini, Hassan Salehi Fathabadi:
Minimum Cost Flow Problem on Dynamic Multi Generative Network flows. 39-48 - Cécile Murat, Vangelis Th. Paschos:
Probabilistic optimization in graph-problems. 49-64
Volume 5, Number 2, 2010
- R. Chandrasekaran:
Santosh Narayan Kabadi 1956-2010.
- Javier Peña, Xavier Saynac, Juan Carlos Vera, Luis Fernando Zuluaga:
Computing general static-arbitrage bounds for European basket options via Dantzig-Wolfe decomposition. 65-74 - François-Xavier Meuwly, Bernard Ries, Nicolas Zufferey:
Solution Methods for a Scheduling Problem with Incompatibility and Precedence Constraints. 75-85 - Nora Touati Moungla, Lucas Létocart, Anass Nagih:
Solutions diversification in a column generation algorithm. 86-95 - Brian C. Dean:
Speeding up Stochastic Dynamic Programming with Zero-Delay Convolution. 96-104 - Martti Hamina, Matti Peltola:
Some Structural Properties of a Least Central Subtree of a Tree. 105-118 - Antje Kiesel, Céline Engelbeen:
Binary matrix decompositions without tongue-and-groove underdosage for radiation therapy planning. 119-132
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 2026-08-29 00:09 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
