Остановите войну!
for scientists:
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 32 matches
- 1999
- Joseph Abate, Ward Whitt:
Explicit M/G/1 waiting-time distributions for a class of long-tail service-time distributions. Oper. Res. Lett. 25(1): 25-31 (1999) - Agostinho Agra, Miguel Fragoso Constantino:
Lotsizing with backlogging and start-ups: the case of Wagner-Whitin costs. Oper. Res. Lett. 25(2): 81-88 (1999) - J. Ben Atkinson:
On some parallels between the loss probability in the GI/G/1 loss system and the delay probability in the GI/G/1 queue. Oper. Res. Lett. 25(4): 191-194 (1999) - Aharon Ben-Tal, Arkadi Nemirovski:
Robust solutions of uncertain linear programs. Oper. Res. Lett. 25(1): 1-13 (1999) - Thomas Bonald, Douglas G. Down:
Stability of mixed generalized Jackson networks. Oper. Res. Lett. 25(3): 131-136 (1999) - Fangruo Chen:
Worst-case analysis of (R, Q) policies in a two-stage serial inventory system with deterministic demand and backlogging. Oper. Res. Lett. 25(2): 51-58 (1999) - Fabián A. Chudak, Dorit S. Hochbaum:
A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine. Oper. Res. Lett. 25(5): 199-204 (1999) - Edward G. Coffman Jr., Predrag R. Jelenkovic:
Performance of the move-to-front algorithm with Markov-modulated request sequences. Oper. Res. Lett. 25(3): 109-118 (1999) - Geir Dahl:
Notes on polyhedra associated with hop-constrained paths. Oper. Res. Lett. 25(2): 97-100 (1999) - Mauro Dell'Amico, Martine Labbé, Francesco Maffioli:
Exact solution of the SONET Ring Loading Problem. Oper. Res. Lett. 25(3): 119-129 (1999) - Dragomir D. Dimitrijevic:
A solution to mean delay in the SigmaMc/Gck/1 cyclic priority queue with cycle (k) and class (c) dependent feedback and service times. Oper. Res. Lett. 25(3): 137-145 (1999) - Carlo Filippi:
A reverse search algorithm for the neighborhood problem. Oper. Res. Lett. 25(1): 33-37 (1999) - Toshihiro Fujito:
On approximation of the submodular set cover problem. Oper. Res. Lett. 25(4): 169-174 (1999) - Virginie Gabrel, Arnaud Knippel, Michel Minoux:
Exact solution of multicommodity network optimization problems with general step cost functions. Oper. Res. Lett. 25(1): 15-23 (1999) - Donald Goldfarb, Zhiying Jin:
A new scaling algorithm for the minimum cost network flow problem. Oper. Res. Lett. 25(5): 205-211 (1999) - Sy-Ming Guu:
Properties of the multiple lot-sizing problem with rigid demand, general cost structures, and interrupted geometric yield. Oper. Res. Lett. 25(2): 59-65 (1999) - Jing Hu, Ellis L. Johnson:
Computational results with a primal-dual subproblem simplex method. Oper. Res. Lett. 25(4): 149-157 (1999) - Masaaki Kijima, Tetsu Takimoto:
A (T, S) inventory/production system with limited production capacity and uncertain demands. Oper. Res. Lett. 25(2): 67-79 (1999) - P. Vijaya Laxmi, U. C. Gupta:
On the finite-buffer bulk-service queue with general independent arrivals: GI/M[b]/1/N. Oper. Res. Lett. 25(5): 241-245 (1999) - Eui Yong Lee, Jiyeon Lee:
An optimal proportion of perfect repair. Oper. Res. Lett. 25(3): 147-148 (1999) - Duan Li:
Zero duality gap in integer programming: P-norm surrogate constraint method. Oper. Res. Lett. 25(2): 89-96 (1999) - Fen-Hui Lin, Way Kuo, Frank Hwang:
Structure importance of consecutive-k-out-of-n systems. Oper. Res. Lett. 25(2): 101-107 (1999) - Richard Loulou, Amit Kanudia:
Minimax regret strategies for greenhouse gas abatement: methodology and application. Oper. Res. Lett. 25(5): 219-230 (1999) - Vittorio Maniezzo, Aristide Mingozzi:
The project scheduling problem with irregular starting time costs. Oper. Res. Lett. 25(4): 175-182 (1999) - Csaba Mészáros:
Steplengths in interior-point algorithms of quadratic programming. Oper. Res. Lett. 25(1): 39-45 (1999) - Michael K. Ng:
A note on policy algorithms for discounted Markov decision problems. Oper. Res. Lett. 25(4): 195-197 (1999) - Michael Patriksson, Laura Wynter:
Stochastic mathematical programs with equilibrium constraints. Oper. Res. Lett. 25(4): 159-167 (1999) - John Preater:
The best-choice problem for partially ordered objects. Oper. Res. Lett. 25(4): 187-190 (1999) - Cornelis Roos, Tamás Terlaky:
Note on a paper of Broyden. Oper. Res. Lett. 25(4): 183-186 (1999) - Tugrul Sanli, Vidyadhar G. Kulkarni:
Optimal admission to reader-writer systems with no queueing. Oper. Res. Lett. 25(5): 213-218 (1999)
skipping 2 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-05-24 15:06 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