default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmic Operations Research, Volume 1
Volume 1, Number 1, 2006
- Katta G. Murty:
A New Practically Efficient Interior Point Method for LP. - Christopher J. Donohue, John R. Birge:
The Abridged Nested Decomposition Method for Multistage Stochastic Linear Programs with Relatively Complete Recourse. - Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert:
On the Stability of Approximation for Hamiltonian Path Problems. - Gerard Sierksma, Gert A. Tijssen:
Simplex Adjacency Graphs in Linear Optimization. - Gregory Z. Gutin, Angela Koller, Anders Yeo:
Note on Upper Bounds for TSP Domination Number. - Consolación Gil, Raul Baños, Maria Dolores Gil Montoya, Julio Gómez:
Performance of Simulated Annealing, Tabu Search, and Evolutionary Algorithms for Multi-objective Network Partitioning.
Volume 1, Number 2, 2006
- Ralf Klasing, Christian Laforest, Joseph G. Peters, Nicolas Thibault:
Constructing Incremental Sequences in Graphs. - Gregory Z. Gutin, Tommy R. Jensen, Anders Yeo:
On-line bin Packing with Two Item Sizes. - Francis Sourd:
Preemptive Scheduling with Position Costs. - Walid Ben-Ameur, Adam Ouorou:
Mathematical Models of the Delay Constrained Routing Problem. - Saswati Tripathi, Bhawna Minocha:
Vehicle Routing Problem with Time Windows: An Evolutionary Algorithmic Approach.
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-10-22 02:18 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
