Остановите войну!
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 74 matches
- 1983
- V. Akileswaran, Gordon B. Hazen, Thomas L. Morin:
Complexity of the Project Sequencing Problem. Oper. Res. 31(4): 772-778 (1983) - R. G. Alsmiller Jr., J. Barish, J. D. Drischler, J. E. Horwedel, J. L. Lucius, J. W. McAdoo:
Sensitivity Theory and Its Application to a Large Energy-Economics Model. Oper. Res. 31(5): 915-937 (1983) - Barry C. Arnold, Patrick L. Brockett:
Technical Note - When Does the βth Percentile Residual Life Function Determine the Distribution? Oper. Res. 31(2): 391-396 (1983) - Richard P. Bagozzi:
A Holistic Methodology for Modeling Consumer Response to Innovation. Oper. Res. 31(1): 128-176 (1983) - Edward K. Baker:
Technical Note - An Exact Algorithm for the Time-Constrained Traveling Salesman Problem. Oper. Res. 31(5): 938-945 (1983) - K. R. Baker, Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints. Oper. Res. 31(2): 381-386 (1983) - Jonathan F. Bard:
An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem. Oper. Res. 31(4): 670-684 (1983) - Jeremy A. Bloom:
Solving an Electricity Generating Capacity Expansion Planning Problem by Generalized Benders' Decomposition. Oper. Res. 31(1): 84-100 (1983) - Philip J. Boland, Frank Proschan:
Optimum Replacement of a System Subject to Shocks. Oper. Res. 31(4): 697-704 (1983) - Jeffrey P. Buzen, Andre B. Bondi:
The Response Times of Priority Classes under Preemptive Resume in M/M/m Queues. Oper. Res. 31(3): 456-465 (1983) - R. Chandrasekaran:
Technical Note - Monotone Optimal Issuing Policies in a Deterministic Inventory Model. Oper. Res. 31(3): 591-595 (1983) - Hung-Po Chao, Alan S. Manne:
Oil Stockpiles and Import Reductions: A Dynamic Programming Approach. Oper. Res. 31(4): 632-651 (1983) - Kalyan Chatterjee, William Samuelson:
Bargaining under Incomplete Information. Oper. Res. 31(5): 835-851 (1983) - Harlan P. Crowder, Ellis L. Johnson, Manfred W. Padberg:
Solving Large-Scale Zero-One Linear Programming Problems. Oper. Res. 31(5): 803-834 (1983) - William H. Cunningham:
Technical Note - A Class of Linear Programs Convertible to Network Problems. Oper. Res. 31(2): 387-391 (1983) - Eliezer Dekel, Sartaj Sahni:
Parallel Scheduling Algorithms. Oper. Res. 31(1): 24-49 (1983) - Zvi Drezner:
Technical Note - The Nested Ball Principle for the Relaxation Method. Oper. Res. 31(3): 587-590 (1983) - Emad El-Neweihi, Frank Proschan, Jayaram Sethuraman:
A Multivariate New Better than Used Class Derived from a Shock Model. Oper. Res. 31(1): 177-183 (1983) - J. Erschler, Gérard Fontan, Colette Mercé, François Roubellat:
A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates. Oper. Res. 31(1): 114-127 (1983) - Awi Federgruen, Zvi Schechner:
Technical Note - Cost Formulas for Continuous Review Inventory Models with Fixed Delivery Lags. Oper. Res. 31(5): 957-965 (1983) - George S. Fishman:
Accelerated Accuracy in the Simulation of Markov Chains. Oper. Res. 31(3): 466-487 (1983) - George S. Fishman:
Accelerated Convergence in the Simulation of Countably Infinite State Markov Chains. Oper. Res. 31(6): 1074-1089 (1983) - Masao Fukushima:
An Outer Approximation Algorithm for Solving General Convex Programs. Oper. Res. 31(1): 101-113 (1983) - Saul I. Gass:
Feature Article - Decision-Aiding Models: Validation, Assessment, and Related Issues for Policy Analysis. Oper. Res. 31(4): 603-631 (1983) - Stanley B. Gershwin, Irvin C. Schick:
Modeling and Analysis of Three-Stage Transfer Lines with Unreliable Machines and Finite Buffers. Oper. Res. 31(2): 354-380 (1983) - Alan J. Goldman:
Technical Note - Linearization in 0-1 Variables: A Clarification. Oper. Res. 31(5): 946-947 (1983) - Stephen C. Graves, Julian Keilson:
System Balance for Extended Logistic Systems. Oper. Res. 31(2): 234-252 (1983) - Stephen C. Graves, Bruce W. Lamar:
An Integer Programming Procedure for Assembly System Design Problems. Oper. Res. 31(3): 522-545 (1983) - Richard C. Grinold:
Model Building Techniques for the Correction of End Effects in Multistage Convex Programs. Oper. Res. 31(3): 407-431 (1983) - Philip Heidelberger, Peter D. Welch:
Simulation Run Length Control in the Presence of an Initial Transient. Oper. Res. 31(6): 1109-1144 (1983)
skipping 44 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-05 18:35 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