Остановите войну!
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 103 matches
- 1984
- Avinash Agrawal, Richard E. Barlow:
A Survey of Network Reliability and Domination Theory. Oper. Res. 32(3): 478-492 (1984) - Avinash Agrawal, Appajosyula Satyanarayana:
An O(|E|) Time Algorithm for Computing the Reliability of a Class of Directed Networks. Oper. Res. 32(3): 493-515 (1984) - Susan L. Albin:
Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues. Oper. Res. 32(5): 1133-1162 (1984) - David Assaf, Naftali A. Langberg, Thomas H. Savits, Moshe Shaked:
Multivariate Phase-Type Distributions. Oper. Res. 32(3): 688-702 (1984) - Yair M. Babad, Jeffrey A. Hoffer:
A Mathematical Programming Model for the Location of Access Controls in a Distributed Data Base Environment. Oper. Res. 32(1): 23-40 (1984) - Uttarayan Bagchi:
Technical Note - A Note on Linearly Decreasing, Delay-Dependent Non-Preemptive Queue Disciplines. Oper. Res. 32(4): 952-957 (1984) - James C. Bean:
Technical Note - A Langrangian Algorithm for the Multiple Choice Integer Program. Oper. Res. 32(5): 1185-1193 (1984) - A. Bendell, N. H. Scott:
Nested Renewal Processes with Special Erlangian Densities. Oper. Res. 32(6): 1345-1357 (1984) - Menachem Berg:
A Preventive Replacement Policy for Units Subject to Intermittent Demand. Oper. Res. 32(3): 584-595 (1984) - Bo Bergman, Bengt Klefsjö:
The Total Time on Test Concept and Its Use in Reliability Theory. Oper. Res. 32(3): 596-606 (1984) - Gabriel R. Bitran, Horacio Hideki Yanasse:
Deterministic Approximations to Stochastic Production Problems. Oper. Res. 32(5): 999-1018 (1984) - Henry W. Block, Thomas H. Savits:
Continuous Multistate Structure Functions. Oper. Res. 32(3): 703-714 (1984) - Jeremy A. Bloom, Michael Caramanis, Leonid Charny:
Long-Range Generation Planning Using Generalized Benders' Decomposition: Implementation and Experience. Oper. Res. 32(2): 290-313 (1984) - Saul Blumenthal, J. Arthur Greenwood, Leon H. Herbach:
Series Systems and Reliability Demonstration Tests. Oper. Res. 32(3): 641-648 (1984) - Adam B. Borison, Peter A. Morris, Shmuel S. Oren:
A State-of-the-World Decomposition Approach to Dynamics and Uncertainty in Electric Utility Generation Expansion Planning. Oper. Res. 32(5): 1052-1068 (1984) - Russell A. Boyles, Francisco J. Samaniego:
Estimating a Survival Curve when New Is Better Than Used. Oper. Res. 32(3): 732-740 (1984) - Percy H. Brill, Jacob Hornik:
A System Point Approach to Nonuniform Advertising Insertions. Oper. Res. 32(1): 7-22 (1984) - Mark Brown:
On the Reliability of Repairable Systems. Oper. Res. 32(3): 607-615 (1984) - Gerald G. Brown:
Letter to the Editor - In Remembrance of Richard Clasen. Oper. Res. 32(4): 969-970 (1984) - J. Randall Brown:
The Linear Sharing Problem. Oper. Res. 32(5): 1087-1106 (1984) - Michael C. Burstein, Christopher H. Nevison, Robert C. Carlson:
Dynamic Lot-Sizing When Demand Timing Is Uncertain. Oper. Res. 32(2): 362-379 (1984) - David A. Butler, Gerald J. Lieberman:
Inspection Policies for Fault Location. Oper. Res. 32(3): 566-574 (1984) - Thomas H. Byers, Michael S. Waterman:
Technical Note - Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming. Oper. Res. 32(6): 1381-1384 (1984) - Giorgio Carpaneto, Silvano Martello, Paolo Toth:
An Algorithm for the Bottleneck Traveling Salesman Problem. Oper. Res. 32(2): 380-389 (1984) - Eng Ung Choo:
Technical Note - Proper Efficiency and the Linear Fractional Vector Maximum Problem. Oper. Res. 32(1): 216-220 (1984) - Richard J. Clasen:
The Solution of the Chemical Equilibrium Programming Problem with Generalized Benders Decomposition. Oper. Res. 32(1): 70-79 (1984) - W. Peyton Cunningham, Denys Freeman, Joseph F. McCloskey:
OR Forum - Of Radar and Operations Research: An Appreciation of A. P. Rowe (1898-1976). Oper. Res. 32(4): 958-967 (1984) - Stella Dafermos, Anna Nagurney:
Sensitivity Analysis for the General Spatial Economic Equilibrium Problem. Oper. Res. 32(5): 1069-1086 (1984) - Cyrus Derman, G. J. Lieberman, Sheldon M. Ross:
On the Use of Replacements to Extend System Life. Oper. Res. 32(3): 616-627 (1984) - Ted Dintersmith:
A Separating Choice Hyperplane Algorithm for Evaluating Multiattribute Decisions. Oper. Res. 32(6): 1328-1344 (1984)
skipping 73 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-30 18:17 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