![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
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 50 matches
- 1992
- Guillermo Gallego
, Dong Shaw, David Simchi-Levi:
The complexity of the staggering problem, and other classical inventory problems. Oper. Res. Lett. 12(1): 47-52 (1992) - Joseph Abate, Ward Whitt:
Numerical inversion of probability generating functions. Oper. Res. Lett. 12(4): 245-251 (1992) - Joseph Abate, Ward Whitt:
Solving probability transform functional equations for numerical inversion. Oper. Res. Lett. 12(5): 275-281 (1992) - Carlos Henggeler Antunes
, João C. N. Clímaco:
Sensitivity analysis in MCDM using the weight space. Oper. Res. Lett. 12(3): 187-196 (1992) - Yair Arian, Yonatan Levy:
Algorithms for generalized round robin routing. Oper. Res. Lett. 12(5): 313-319 (1992) - Ronald D. Armstrong, Zhiying Jin:
Solving linear bottleneck assignment problems via strong spanning trees. Oper. Res. Lett. 12(3): 179-180 (1992) - Francisco Barahona:
Separating from the dominant of the spanning tree polytope. Oper. Res. Lett. 12(4): 201-203 (1992) - Michael Bastian, M. Volkmer:
A perfect forward procedure for a single facility dynamic location/relocation problem. Oper. Res. Lett. 12(1): 11-16 (1992) - Alain Billionnet, Alain Sutter:
An efficient algorithm for the 3-satisfiability problem. Oper. Res. Lett. 12(1): 29-36 (1992) - Sid Browne, Gideon Weiss:
Dynamic priority rules when polling with multiple parallel servers. Oper. Res. Lett. 12(3): 129-137 (1992) - Domingos M. Cardoso
, João C. N. Clímaco:
The generalized simplex method. Oper. Res. Lett. 12(5): 337-348 (1992) - Fangruo Chen, Yu-Sheng Zheng:
Waiting time distribution in (T, S) inventory systems. Oper. Res. Lett. 12(3): 145-151 (1992) - Dinah W. Cheng:
Second order properties in a tandem queue with general blocking. Oper. Res. Lett. 12(3): 139-144 (1992) - Chengbin Chu
:
Efficient heuristics to minimize total flow time with release dates. Oper. Res. Lett. 12(5): 321-330 (1992) - Nico M. van Dijk:
Uniformization for nonhomogeneous Markov chains. Oper. Res. Lett. 12(5): 283-291 (1992) - János Fülöp, Mária Prill:
On the minimax approximation in the class of the univariate piecewise constant functions. Oper. Res. Lett. 12(5): 307-312 (1992) - Lov K. Grover:
Local search and the local structure of NP-complete problems. Oper. Res. Lett. 12(4): 235-243 (1992) - Diwakar Gupta:
On the economic lot scheduling problem with backlogging: The common cycle approach. Oper. Res. Lett. 12(2): 101-109 (1992) - Refael Hassin:
Algorithms for the minimum cost circulation problem based on maximizing the mean improvement. Oper. Res. Lett. 12(4): 227-233 (1992) - Johan Hellstrand, Torbjörn Larsson
, Athanasios Migdalas:
A characterization of the uncapacitated network design polytope. Oper. Res. Lett. 12(3): 159-163 (1992) - Dick den Hertog, Cees Roos, Tamás Terlaky:
A build-up variant of the logarithmic barrier method for LP. Oper. Res. Lett. 12(3): 181-186 (1992) - Frank K. Hwang, Uriel G. Rothblum:
Generalization of an engineering principle. Oper. Res. Lett. 12(4): 197-199 (1992) - Erwin Kalvelagen, Henk C. Tijms:
ORSTAT: Software for operations research and statistics. Oper. Res. Lett. 12(2): 125-127 (1992) - Jerzy Kamburowski:
Bounding the distribution of project duration in PERT networks. Oper. Res. Lett. 12(1): 17-22 (1992) - J. Mark Keil:
On the complexity of scheduling tasks with discrete starting times. Oper. Res. Lett. 12(5): 293-295 (1992) - Rajeev Kohli, Ramesh Krishnamurti:
A total-value greedy heuristic for the integer knapsack problem. Oper. Res. Lett. 12(2): 65-71 (1992) - Anurag Kumar:
On the average idle time and average queue length estimates in an M/M/1 queue. Oper. Res. Lett. 12(3): 153-157 (1992) - Tsai Li-Hui:
Sequencing to minimize the maximum renewal cumulative cost. Oper. Res. Lett. 12(2): 117-124 (1992) - Richard Loulou:
Minimal cut cover of a graph with an application to the testing of electronic boards. Oper. Res. Lett. 12(5): 301-305 (1992) - Vangelis F. Magirou:
An improved partial solution to the task assignment and multiway cut problems. Oper. Res. Lett. 12(1): 3-10 (1992)
skipping 20 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.org/img/cog.dark.24x24.png)
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-07-30 20: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