Остановите войну!
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 113 matches
- 1990
- Warren P. Adams, Hanif D. Sherali:
Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems. Oper. Res. 38(2): 217-226 (1990) - Edward J. Anderson:
Testing Feasibility in a Lot Scheduling Problem. Oper. Res. 38(6): 1079-1088 (1990) - David Assaf, J. George Shanthikumar:
Optimal Spares Provisioning When Component Price Is Changing. Oper. Res. 38(2): 319-329 (1990) - Sven Axsäter:
Simple Solution Procedures for a Class of Two-Echelon Inventory Problems. Oper. Res. 38(1): 64-69 (1990) - Kenneth R. Baker, Gary D. Scudder:
Sequencing with Earliness and Tardiness Penalties: A Review. Oper. Res. 38(1): 22-36 (1990) - John J. Bartholdi III, Kevin L. McCroan:
Scheduling Interviews for a Job Fair. Oper. Res. 38(6): 951-960 (1990) - Omar Ben-Ayed, Charles E. Blair:
Computational Difficulties of Bilevel Linear Programming. Oper. Res. 38(3): 556-560 (1990) - Moshe Ben-Horim, Dror Zuckerman:
Stimulating Job Search Through the Unemployment Insurance System. Oper. Res. 38(2): 359-361 (1990) - Arthur T. Benjamin:
Graphs, Maneuvers and Turnpikes. Oper. Res. 38(2): 202-216 (1990) - Menachem Berg, Morton J. M. Posner:
Customer Delay in M/G/∞ Repair Systems with Spares. Oper. Res. 38(2): 344-348 (1990) - Oded Berman, D. Einav, Gabriel Y. Handler:
The Constrained Bottleneck Problem in Networks. Oper. Res. 38(1): 178-181 (1990) - Dimitris Bertsimas:
An Analytic Approach to a General Class of G/G/s Queueing Systems. Oper. Res. 38(1): 139-155 (1990) - Dimitris J. Bertsimas, Patrick Jaillet, Amedeo R. Odoni:
A Priori Optimization. Oper. Res. 38(6): 1019-1033 (1990) - Lawrence D. Bodin:
Twenty Years of Routing and Scheduling. Oper. Res. 38(4): 571-579 (1990) - Robert F. Bordley:
Measuring Risk Reduction Benefits with Discounted Longevity. Oper. Res. 38(5): 815-819 (1990) - Margaret L. Brandeau, Samuel S. Chiu:
A Unified Family of Single-Server Queueing Location Models. Oper. Res. 38(6): 1034-1044 (1990) - Gerald G. Brown, Clark E. Goodman, R. Kevin Wood:
Annual Scheduling of Atlantic Fleet Naval Combatants. Oper. Res. 38(2): 249-259 (1990) - Sid Browne, Uri Yechiali:
Scheduling Deteriorating Jobs on a Single Processor. Oper. Res. 38(3): 495-498 (1990) - William J. Carolan, James E. Hill, Jeffery L. Kennington, Sandra Niemi, Stephen J. Wichmann:
An Empirical Evaluation of the KORBX® Algorithms for Military Airlift Applications. Oper. Res. 38(2): 240-248 (1990) - Suresh Chand, Suresh P. Sethi:
A Dynamic Lot Sizing Model with Learning in Setups. Oper. Res. 38(4): 644-655 (1990) - Suresh Chand, Suresh P. Sethi, Jean-Marie Proth:
Existence of Forecast Horizons in Undiscounted Discrete-Time Lot Size Models. Oper. Res. 38(5): 884-892 (1990) - Hung-Po Chao, Robert B. Wilson:
Optimal Contract Period for Priority Service. Oper. Res. 38(4): 598-606 (1990) - Tat-Chi Chow, Robert M. Oliver, G. Anthony Vignaux:
A Bayesian Escalation Model to Predict Nuclear Accidents and Risk. Oper. Res. 38(2): 265-277 (1990) - Gehan A. Corea, Vidyadhar G. Kulkarni:
Minimum Cost Routing on Stochastic Networks. Oper. Res. 38(3): 527-536 (1990) - Maqbool Dada, K. N. Srikanth:
Monopolistic Pricing and the Learning Curve: An Algorithmic Approach. Oper. Res. 38(4): 656-666 (1990) - Hans Daduna:
Exchangeable Items in Repair Systems: Delay Times. Oper. Res. 38(2): 349-354 (1990) - Yves Dallery, Kathryn E. Stecke:
On the Optimal Allocation of Servers and Workloads in Closed Queueing Networks. Oper. Res. 38(4): 694-703 (1990) - Mark S. Daskin, Philip C. Jones, Timothy J. Lowe:
Rationalizing Tool Selection in a Flexible Manufacturing System for Sheet-Metal Products. Oper. Res. 38(6): 1104-1115 (1990) - Luc Devroye:
Coupled Samples in Simulation. Oper. Res. 38(1): 115-126 (1990) - James S. Dyer, Richard N. Lund, John B. Larsen, V. Kumar, Robert P. Leone:
A Decision Support System for Prioritizing Oil and Gas Exploration Activities. Oper. Res. 38(3): 386-396 (1990)
skipping 83 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-12 16:11 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