default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 96 matches
- 2006
- Tobias Achterberg, Thorsten Koch, Alexander Martin:
MIPLIB 2003. Oper. Res. Lett. 34(4): 361-372 (2006) - Ivo J. B. F. Adan, J. S. H. van Leeuwaarden, Erik M. M. Winands:
On the application of Rouché's theorem in queueing theory. Oper. Res. Lett. 34(3): 355-360 (2006) - Michele Aghassi, Dimitris Bertsimas, Georgia Perakis:
Solving asymmetric variational inequalities via convex optimization. Oper. Res. Lett. 34(5): 481-490 (2006) - Hatem Ben Amor, Jacques Desrosiers, François Soumis:
Recovering an optimal LP basis from an optimal dual solution. Oper. Res. Lett. 34(5): 569-576 (2006) - Derek E. Armstrong, Sheldon H. Jacobson:
Order preserving reductions and polynomial improving paths. Oper. Res. Lett. 34(1): 9-16 (2006) - Igor Averbakh, Vasilij Lebedev:
The competitive salesman problem on a network: a worst-case approach. Oper. Res. Lett. 34(2): 165-174 (2006) - Florin Avram, Antonio Gómez-Corral:
On the optimal control of a two-queue polling model. Oper. Res. Lett. 34(3): 339-348 (2006) - Zeynep Müge Avsar, Melike Baykal-Gursoy:
A note on two-person zero-sum communicating stochastic games. Oper. Res. Lett. 34(4): 412-420 (2006) - Matthew D. Bailey, Steven M. Shechter, Andrew J. Schaefer:
SPAR: stochastic programming with adversarial recourse. Oper. Res. Lett. 34(3): 307-315 (2006) - Mohammed Fazle Baki:
A new asymmetric pyramidally solvable class of the traveling salesman problem. Oper. Res. Lett. 34(6): 613-620 (2006) - Abhijit Datta Banik, U. C. Gupta, S. S. Pathak:
Finite buffer vacation models under E-limited with limit variation service and Markovian arrival process. Oper. Res. Lett. 34(5): 539-547 (2006) - Javiera Barrera, Thierry Huillet, Christian Paroissin:
Limiting search cost distribution for the move-to-front rule with random request probabilities. Oper. Res. Lett. 34(5): 557-563 (2006) - Natashia Boland, John Dethridge, Irina Dumitrescu:
Accelerated label setting algorithms for the elementary resource constrained shortest path problem. Oper. Res. Lett. 34(1): 58-68 (2006) - Pierre Bonami, Michel Minoux:
Exact MAX-2SAT solution via lift-and-project closure. Oper. Res. Lett. 34(4): 387-393 (2006) - Tobias Brüggemann, Johann L. Hurink, Walter Kern:
Quality of move-optimal schedules for minimizing total weighted completion time. Oper. Res. Lett. 34(5): 583-590 (2006) - Carl Bussema, Eric Torng:
Greedy multiprocessor server scheduling. Oper. Res. Lett. 34(4): 451-458 (2006) - Pedro Calleja, Arantza Estévez-Fernández, Peter Borm, Herbert Hamers:
Job scheduling, cooperation, and control. Oper. Res. Lett. 34(1): 22-28 (2006) - Robert D. Carr, Ojas Parekh:
A 1/2-integral relaxation for the A-matching problem. Oper. Res. Lett. 34(4): 445-450 (2006) - Alberto Ceselli, Giovanni Righini:
An optimization algorithm for a penalized knapsack problem. Oper. Res. Lett. 34(4): 394-404 (2006) - Kyung C. Chae, Sangmin Lee, Ho Woo Lee:
On stochastic decomposition in the GI/M/1 queue with single exponential vacation. Oper. Res. Lett. 34(6): 706-712 (2006) - Shuchi Chawla, Uday Rajan, R. Ravi, Amitabh Sinha:
Min-Max payoffs in a two-player location game. Oper. Res. Lett. 34(5): 499-507 (2006) - Xin Chen, David Simchi-Levi:
Coordinating inventory control and pricing strategies: The continuous review model. Oper. Res. Lett. 34(3): 323-332 (2006) - T. C. Edwin Cheng, Yong He, Han Hoogeveen, Min Ji, Gerhard J. Woeginger:
Scheduling with step-improving processing times. Oper. Res. Lett. 34(1): 37-40 (2006) - José R. Correa:
Resource augmentation in two-dimensional packing with orthogonal rotations. Oper. Res. Lett. 34(1): 85-93 (2006) - Marie-Christine Costa, Lucas Létocart, Frédéric Roupin:
Erratum to "A greedy algorithm for multicut and integral multiflow in rooted tress" [Oper. Res. Lett 31(1) (2003) 21-27]. Oper. Res. Lett. 34(4): 477 (2006) - Yaodong Cui:
Simplest optimal cutting patterns for equal rectangles. Oper. Res. Lett. 34(6): 630-638 (2006) - Geir Dahl, David Huygens, Ali Ridha Mahjoub, Pierre Pesneau:
On the k edge-disjoint 2-hop-constrained paths polytope. Oper. Res. Lett. 34(5): 577-582 (2006) - Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger:
The traveling salesman problem with few inner points. Oper. Res. Lett. 34(1): 106-110 (2006) - Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger:
Exact algorithms for the Hamiltonian cycle problem in planar graphs. Oper. Res. Lett. 34(3): 269-274 (2006) - Vladimir G. Deineko, Gerhard J. Woeginger:
On the robust assignment problem under a fixed number of cost scenarios. Oper. Res. Lett. 34(2): 175-179 (2006)
skipping 66 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-26 18:34 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint