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 30 matches
- 2001
- Jesus R. Artalejo, Alexander N. Dudin, Valentina I. Klimenok:
Stationary analysis of a retrial queue with preemptive repeated attempts. Oper. Res. Lett. 28(4): 173-180 (2001) - Philippe Baptiste, Vadim G. Timkovsky:
On preemption redundancy in scheduling unit processing time jobs on two parallel machines. Oper. Res. Lett. 28(5): 205-212 (2001) - Laurens Cherchye, Tom Van Puyenbroeck:
A comment on multi-stage DEA methodology. Oper. Res. Lett. 28(2): 93-98 (2001) - Gérard Cornuéjols, Yanjun Li:
Elementary closures for integer programs. Oper. Res. Lett. 28(1): 1-8 (2001) - Vladimir G. Deineko, Gerhard J. Woeginger:
A comment on consecutive-2-out-of-n systems. Oper. Res. Lett. 28(4): 169-171 (2001) - Ismael R. de Farias Jr.:
A family of facets for the uncapacitated p-median polytope. Oper. Res. Lett. 28(4): 161-167 (2001) - Srinagesh Gavirneni:
An efficient heuristic for inventory control when the customer is using a (s, S) policy. Oper. Res. Lett. 28(4): 187-192 (2001) - Gregory Z. Gutin, Anders Yeo:
TSP tour domination and Hamilton cycle decompositions of regular digraphs. Oper. Res. Lett. 28(3): 107-111 (2001) - Margaréta Halická:
Two simple proofs for analyticity of the central path in linear programming. Oper. Res. Lett. 28(1): 9-19 (2001) - Frank K. Hwang:
A new index of component importance. Oper. Res. Lett. 28(2): 75-79 (2001) - Chunfu Jia:
Stochastic single machine scheduling with an exponentially distributed due date. Oper. Res. Lett. 28(5): 199-203 (2001) - Igor V. Konnov:
Relatively monotone variational inequalities over product sets. Oper. Res. Lett. 28(1): 21-26 (2001) - Ho Woo Lee, Won Joo Seo, Seung Hyun Yoon:
An analysis of multiple-class vacation queues with individual thresholds. Oper. Res. Lett. 28(1): 35-49 (2001) - Dean H. Lorenz, Danny Raz:
A simple efficient approximation scheme for the restricted shortest path problem. Oper. Res. Lett. 28(5): 213-219 (2001) - Michel Mandjes:
A note on queues with M/G/infinity input. Oper. Res. Lett. 28(5): 233-242 (2001) - Kenneth Mitchell:
Constructing a correlated sequence of matrix exponentials with invariant first-order properties. Oper. Res. Lett. 28(1): 27-34 (2001) - Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz:
On project scheduling with irregular starting time costs. Oper. Res. Lett. 28(4): 149-154 (2001) - Jakob R. Møller:
Tail asymptotics for M/G/1-type queueing processes with light-tailed increments. Oper. Res. Lett. 28(4): 181-185 (2001) - Tava Lennon Olsen:
Approximations for the waiting time distribution in polling models with and without state-dependent setups. Oper. Res. Lett. 28(3): 113-123 (2001) - P. R. Parthasarathy, N. Selvaraju:
Exact transient solution of a state-dependent queue in discrete time. Oper. Res. Lett. 28(5): 243-248 (2001) - B. Venkateshwara Rao, Richard M. Feldman:
Approximations and bounds for the variance of steady-state waiting times in a GI/G/1 queue. Oper. Res. Lett. 28(2): 51-62 (2001) - Fabrizio Rossi, Stefano Smriglio:
A branch-and-cut algorithm for the maximum cardinality stable set problem. Oper. Res. Lett. 28(2): 63-74 (2001) - Alfred Sham, Y. June Wu, J. David Fuller:
Assessment of several algorithms for multi-period market equilibrium models with geometric distributed lag demand. Oper. Res. Lett. 28(3): 99-106 (2001) - Hanif D. Sherali:
On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions. Oper. Res. Lett. 28(4): 155-160 (2001) - Defeng Sun:
A further result on an implicit function theorem for locally Lipschitz functions. Oper. Res. Lett. 28(4): 193-198 (2001) - Zhiyi Tan, Yong He:
Semi-on-line scheduling with ordinal data on two uniform machines. Oper. Res. Lett. 28(5): 221-231 (2001) - Hoang Q. Tuyen, Le Dung Muu:
Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem. Oper. Res. Lett. 28(2): 81-92 (2001) - Edmond J. Vanderperre:
Point availability of a robot-safety device. Oper. Res. Lett. 28(3): 143-148 (2001) - Gordon E. Willmot, Steve Drekic:
On the transient analysis of the MX/M/infinity queue. Oper. Res. Lett. 28(3): 137-142 (2001) - Heng-Qing Ye, Hong Chen:
Lyapunov method for the stability of fluid networks. Oper. Res. Lett. 28(3): 125-136 (2001)
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-11-25 01:21 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