![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/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 42 matches
- 1993
- Lígia Amado, Paulo Bárcia:
Matroidal relaxations for 0-1 knapsack problems. Oper. Res. Lett. 14(3): 147-152 (1993) - Derek R. Atkins, Shrikanta De:
A performance bound on single cycle lot-sizing policies for an assembly system with stochastic demand. Oper. Res. Lett. 14(5): 265-273 (1993) - Athanassios N. Avramidis
, James R. Wilson:
A splitting scheme for control variates. Oper. Res. Lett. 14(4): 187-198 (1993) - Peter Brucker, Bernd Jurisch, Thomas Tautenhahn, Frank Werner:
Scheduling unit time open shops to minimize the weighted number of late jobs. Oper. Res. Lett. 14(5): 245-250 (1993) - Emilio Carrizosa
, Eduardo Conde
, Francisco R. Fernández, Justo Puerto:
Efficiency in Euclidean constrained location problems. Oper. Res. Lett. 14(5): 291-295 (1993) - Abraham Charnes, Moshe Kress:
Two simple applications of the unimodularity property. Oper. Res. Lett. 14(5): 257-260 (1993) - Irène Charon, Olivier Hudry:
The noising method: a new method for combinatorial optimization. Oper. Res. Lett. 14(3): 133-137 (1993) - Bo Chen
:
A note on LPT scheduling. Oper. Res. Lett. 14(3): 139-142 (1993) - Hong Chen, Ping Yang, David D. Yao, Xiuli Chao:
Optimal control of a simple assembly system. Oper. Res. Lett. 14(4): 199-205 (1993) - Dinah W. Cheng:
Concavity of system throughput and information transfer in a PAC system. Oper. Res. Lett. 14(3): 143-146 (1993) - G. Contaldi, Gianni Di Pillo
, Stefano Lucidi
:
A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set. Oper. Res. Lett. 14(3): 153-161 (1993) - Eric J. Friedman, Adam Scott Landsberg:
Short run dynamics of multi-class queues. Oper. Res. Lett. 14(4): 221-229 (1993) - Myron Hlynka, T. Wang:
Comments on duality of queues with finite buffer size. Oper. Res. Lett. 14(1): 29-33 (1993) - Celina Imielinska, Bahman Kalantari, Leonid Khachiyan:
A greedy heuristic for a minimum-weight forest problem. Oper. Res. Lett. 14(2): 65-71 (1993) - Patrick Jaillet:
Rate of convergence for the Euclidean minimum spanning tree limit law. Oper. Res. Lett. 14(2): 73-78 (1993) - Prafulla Joglekar, Patrick Lee:
An exact formulation of inventory costs and optimal lot size in face of sudden obsolescence. Oper. Res. Lett. 14(5): 283-290 (1993) - Bahman Kalantari, Leonid Khachiyan:
On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms. Oper. Res. Lett. 14(5): 237-244 (1993) - Sehun Kim, Bong-sik Um:
An improved subgradient method for constrained nondifferentiable optimization. Oper. Res. Lett. 14(1): 61-64 (1993) - Wieslaw Kubiak:
Completion time variance minimization on a single machine is difficult. Oper. Res. Lett. 14(1): 49-59 (1993) - Tsung-Chyan Lai:
Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems. Oper. Res. Lett. 14(4): 215-220 (1993) - Andrew J. Lazarus:
Certain expected values in the random assignment problem. Oper. Res. Lett. 14(4): 207-214 (1993) - I-Jen Lee, Emily Roth:
A heuristic for the transient expected queue length of Markovian queueing systems. Oper. Res. Lett. 14(1): 25-27 (1993) - Lei Lei, Ronald Armstrong, Shanhong Gu:
Minimizing the fleet size with dependent time-window and single-track constraints. Oper. Res. Lett. 14(2): 91-98 (1993) - Ravi Mazumdar
, Vivek Badrinath, Fabrice Guillemin
, Catherine Rosenberg:
A note on the pathwise version of Little's formula. Oper. Res. Lett. 14(1): 19-24 (1993) - S. Thomas McCormick:
Approximate binary search algorithms for mean cuts and cycles. Oper. Res. Lett. 14(3): 129-132 (1993) - Masakiyo Miyazawa, Genji Yamazaki:
Note on batch arrival LCFS and related symmetric queues. Oper. Res. Lett. 14(1): 35-41 (1993) - Viên Nguyen, Martin I. Reiman:
Variance reduction for sensitivity estimates obtained from regenerative simulation. Oper. Res. Lett. 14(1): 9-18 (1993) - James B. Orlin
, Clifford Stein:
Parallel algorithms for the assignment and minimum-cost flow problems. Oper. Res. Lett. 14(4): 181-186 (1993) - Irfan M. Ovacik
, Reha Uzsoy
:
Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times. Oper. Res. Lett. 14(5): 251-256 (1993) - John Preater:
The senior and junior secretaries problem. Oper. Res. Lett. 14(4): 231-235 (1993)
skipping 12 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/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-06-25 07:44 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