Остановите войну!
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 36 matches
- 1996
- Agha Iqbal Ali, Shirley Shmerling:
Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies. Oper. Res. Lett. 18(4): 177-184 (1996) - M. L. Chaudhry, U. C. Gupta, James G. C. Templeton:
On the relations among the distributions at different epochs for discrete-time GI/Geom/1 queues. Oper. Res. Lett. 18(5): 247-255 (1996) - Mauro Dell'Amico, Silvano Martello:
Open shop, satellite communication and a theorem by Egerváry (1931). Oper. Res. Lett. 18(5): 207-211 (1996) - Christopher J. Donohue, John R. Birge:
An upper bound on the expected value of a non-increasing convex function with convex marginal return functions. Oper. Res. Lett. 18(5): 213-221 (1996) - Eric J. Friedman, Adam Scott Landsberg:
Long-run dynamics of queues: Stability and chaos. Oper. Res. Lett. 18(4): 185-191 (1996) - Sunan Han, Dawei Hong, Joseph Y.-T. Leung:
Probabilistic analysis of a bin covering algorithm. Oper. Res. Lett. 18(4): 193-199 (1996) - Santosh N. Kabadi, Y. P. Aneia:
ε-Approximation minimization of convex functions in fixed dimension. Oper. Res. Lett. 18(4): 171-176 (1996) - Martine Labbé, Edward F. Schmeichel, S. Louis Hakimi:
Errata and comments on "Approximation algorithms for the capacitated plant allocation problem": [Oper. Res. Lett 15 (1994) 115-126]. Oper. Res. Lett. 18(4): 205 (1996) - Wei-Ping Liu, Jeffrey B. Sidney, André van Vliet:
Ordinal algorithms for parallel machine scheduling. Oper. Res. Lett. 18(5): 223-232 (1996) - Irvin J. Lustig, Edward Rothberg:
Gigaflops in linear programming. Oper. Res. Lett. 18(4): 157-165 (1996) - Abraham P. Punnen, Yash P. Aneja:
On k-sum optimization. Oper. Res. Lett. 18(5): 233-236 (1996) - J. M. J. Schutten:
List scheduling revisited. Oper. Res. Lett. 18(4): 167-170 (1996) - David A. Stanford, Myron Hlynka:
Observing general service queues before joining. Oper. Res. Lett. 18(5): 237-245 (1996) - Guoliang Xue, J. Ben Rosen, Panos M. Pardalos:
A polynomial time dual algorithm for the Euclidean multifacility location problem. Oper. Res. Lett. 18(4): 201-204 (1996) - 1995
- Joseph Abate, Gagan L. Choudhury, Ward Whitt:
Calculating the M/G/1 busy-period density and LIFO waiting-time distribution by direct numerical transform inversion. Oper. Res. Lett. 18(3): 113-119 (1995) - Attahiru Sule Alfa:
A discrete MAP/PH/1 queue with vacations and exhaustive time-limited service. Oper. Res. Lett. 18(1): 31-40 (1995) - Hans L. Bodlaender, Michael R. Fellows:
W[2]-hardness of precedence constrained K-processor scheduling. Oper. Res. Lett. 18(2): 93-97 (1995) - Xiuli Chao:
A queueing network model with catastrophes and product form solution. Oper. Res. Lett. 18(2): 75-79 (1995) - Heng-Yi Chao, Mary P. Harper, Russell W. Quong:
A tight lower bound for optimal bin packing. Oper. Res. Lett. 18(3): 133-138 (1995) - Bo Chen, André van Vliet, Gerhard J. Woeginger:
An optimal algorithm for preemptive on-line scheduling. Oper. Res. Lett. 18(3): 127-131 (1995) - Ariel Cohen, Walter A. Burkhard:
A proof of the optimality of the MIN paging algorithm using linear programming duality. Oper. Res. Lett. 18(1): 7-13 (1995) - Adrian E. Conway, Julian Keilson:
Analysis of a two-stage finite buffer flow controlled queueing model by a compensation method. Oper. Res. Lett. 18(2): 65-74 (1995) - Erhan Erkut:
On the credibility of the conditional risk model for routing hazardous materials. Oper. Res. Lett. 18(1): 49-52 (1995) - Michael C. Fu, Jian-Qiang Hu:
On the relationship of capacitated production/inventory models to manufacturing flow control models. Oper. Res. Lett. 18(1): 15-24 (1995) - Peter W. Glynn, Ward Whitt:
Heavy-traffic extreme-value limits for queues. Oper. Res. Lett. 18(3): 107-111 (1995) - Michael D. Grigoriadis, Leonid G. Khachiyan:
A sublinear-time randomized approximation algorithm for matrix games. Oper. Res. Lett. 18(2): 53-58 (1995) - Wei Li, Jinhua Cao:
Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities. Oper. Res. Lett. 18(2): 81-91 (1995) - Wei Li, James M. Tien:
On a direct estimator for average production intervals. Oper. Res. Lett. 18(1): 41-47 (1995) - C. A. Knox Lovell, Jesús T. Pastor:
Units invariant and translation invariant DEA models. Oper. Res. Lett. 18(3): 147-151 (1995) - Carlos J. Luz:
An upper bound on the independence number of a graph computable in polynomial-time. Oper. Res. Lett. 18(3): 139-145 (1995)
skipping 6 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-23 15:22 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