default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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 33 matches
- 1996
- Ivo J. B. F. Adan, Yiqiang Zhao:
Analyzing GI/Er/1 queues. Oper. Res. Lett. 19(4): 183-190 (1996) - Christos Alexopoulos, Andrew F. Seila:
A conservative method for selecting the best simulated system. Oper. Res. Lett. 19(3): 143-150 (1996) - Le Thi Hoai An
, Pham Dinh Tao, Le Dung Muu:
Numerical solution for optimization over the efficient set by d.c. optimization algorithms. Oper. Res. Lett. 19(3): 117-128 (1996) - Egon Balas, Sebastián Ceria, Gérard Cornuéjols, N. Natraj:
Gomory cuts revisited. Oper. Res. Lett. 19(1): 1-9 (1996) - Laurence A. Baxter, Norman A. Marlow:
Cumulative operating time distributions for a class of non-Markovian series systems. Oper. Res. Lett. 19(3): 135-141 (1996) - Aharon Ben-Tal, Jørgen Tind:
Duality with multiple criteria and multiple resources. Oper. Res. Lett. 19(5): 201-206 (1996) - Mohamed Didi Biha, Ali Ridha Mahjoub:
k-edge connected polyhedra on series-parallel graphs. Oper. Res. Lett. 19(2): 71-78 (1996) - Marne C. Cario, Barry L. Nelson:
Autoregressive to anything: Time-series input processes for simulation. Oper. Res. Lett. 19(2): 51-58 (1996) - Emilio Carrizosa, Frank Plastria:
A characterization of efficient points in constrained location problems with regional demand. Oper. Res. Lett. 19(3): 129-134 (1996) - Marco Castellani:
A necessary second-order optimality condition in nonsmooth mathematical programming. Oper. Res. Lett. 19(2): 79-86 (1996) - Yung-Cheng Chang, Lih-Hsing Hsu:
On minimal cost-reliability ratio spanning trees and related problems. Oper. Res. Lett. 19(2): 65-69 (1996) - Ming-Hui Chen, Bruce W. Schmeiser:
General Hit-and-Run Monte Carlo sampling for evaluating multidimensional integrals. Oper. Res. Lett. 19(4): 161-169 (1996) - T. C. E. Cheng, Zhi-Long Chen, Chung-Lun Li:
Single-machine scheduling with trade-off between number of tardy jobs and resource allocation. Oper. Res. Lett. 19(5): 237-242 (1996) - Israel David, Eitan Greenshtein:
Brownian analysis of a buffered-flow system in the face of sudden obsolescence. Oper. Res. Lett. 19(1): 43-49 (1996) - Dragomir D. Dimitrijevic:
Inferring most likely queue length from transactional data. Oper. Res. Lett. 19(4): 191-199 (1996) - Joseph L. Ganley, Jeffrey S. Salowe:
Optimal and approximate bottleneck Steiner trees. Oper. Res. Lett. 19(5): 217-224 (1996) - Jay B. Ghosh:
Computational aspects of the maximum diversity problem. Oper. Res. Lett. 19(4): 175-181 (1996) - Moshe Haviv:
On constrained Markov decision processes. Oper. Res. Lett. 19(1): 25-28 (1996) - Frank K. Hwang, Paul E. Wright:
Efficient algorithms for the reliabilities of replicated n-parallel-task graphs. Oper. Res. Lett. 19(4): 171-174 (1996) - Wei-Ping Liu, Jeffrey B. Sidney:
Bin packing using semi-ordinal data. Oper. Res. Lett. 19(3): 101-104 (1996) - S. Thomas McCormick:
Submodular containment is hard, even for networks. Oper. Res. Lett. 19(2): 95-99 (1996) - Serpil Sayin:
An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming. Oper. Res. Lett. 19(2): 87-94 (1996) - Linn I. Sennott:
The convergence of value iteration in average cost Markov decision chains. Oper. Res. Lett. 19(1): 11-16 (1996) - Suresh P. Sethi, Xun Yu Zhou:
Optimal feedback controls in deterministic dynamic two-machine flowshops. Oper. Res. Lett. 19(5): 225-235 (1996) - Hanif D. Sherali, Gyunghyun Choi:
Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs. Oper. Res. Lett. 19(3): 105-113 (1996) - Neng-Hui Shih, Wheyming Tina Song:
Correlation-inducing variance reduction in regenerative simulation. Oper. Res. Lett. 19(1): 17-23 (1996) - Caterina De Simone:
A note on the Boolean quadric polytope. Oper. Res. Lett. 19(3): 115-116 (1996) - Sverre Storøy:
Optimal weights and degeneracy in variable aggregated linear programs. Oper. Res. Lett. 19(1): 29-31 (1996) - Wlodzimierz Szwarc, Samar K. Mukhopadhyay:
Decomposition of the single machine total tardiness problem. Oper. Res. Lett. 19(5): 243-250 (1996) - Arie Tamir:
An O(pn2) algorithm for the p-median and related problems on tree graphs. Oper. Res. Lett. 19(2): 59-64 (1996)
skipping 3 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 2025-01-18 18:54 CET 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
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:
