![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.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 92 matches
- 1987
- Russell L. Ackoff:
Presidents' Symposium: OR, A Post Mortem. Oper. Res. 35(3): 471-474 (1987) - Shoshana Anily, Awi Federgruen:
Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods. Oper. Res. 35(6): 867-874 (1987) - Uttarayan Bagchi, Reza H. Ahmadi:
Technical Note - An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines. Oper. Res. 35(2): 311-313 (1987) - Harish C. Bahl, Larry P. Ritzman, Jatinder N. D. Gupta
:
OR Practice - Determining Lot Sizes and Resource Requirements: A Review. Oper. Res. 35(3): 329-345 (1987) - Arnold Barnett:
Prison Populations: A Projection Model. Oper. Res. 35(1): 18-34 (1987) - James C. Bean, John R. Birge
, Robert L. Smith:
Aggregation in Dynamic Programming. Oper. Res. 35(2): 215-220 (1987) - Alfred Blumstein:
Presidents' Symposium: The Current Missionary Role of OR/MS. Oper. Res. 35(6): 926-929 (1987) - Jack R. Borsting:
OR Forum - Presidents' Symposium: Reflections on OR/MS Education. Oper. Res. 35(5): 787-791 (1987) - Steven J. Brams, D. Marc Kilgour:
Optimal Threats. Oper. Res. 35(4): 524-536 (1987) - Margaret L. Brandeau, David S. P. Hopkins, Kenneth L. Melmon:
An Integrated Budget Model for Medical School Financial Planning. Oper. Res. 35(5): 684-703 (1987) - Richard N. Burns, G. J. Koop:
A Modular Approach to Optimal Multiple-Shift Manpower Scheduling. Oper. Res. 35(1): 100-110 (1987) - Richard H. Byrd, Alan J. Goldman, Miriam Heller:
Technical Note - Recognizing Unbounded Integer Programs. Oper. Res. 35(1): 140-142 (1987) - Malachy Carey
:
Optimal Time-Varying Flows on Congested Networks. Oper. Res. 35(1): 58-69 (1987) - Hung-Po Chao:
Inventory Policy in the Presence of Market Disruptions. Oper. Res. 35(2): 274-281 (1987) - Bor-Chung Chen, Robert G. Sargent:
Using Standardized Time Series to Estimate Confidence Intervals for the Difference Between Two Stationary Stochastic Processes. Oper. Res. 35(3): 428-436 (1987) - Shirish D. Chikte, Sudhakar D. Deshmukh:
The Role of External Search in Bilateral Bargaining. Oper. Res. 35(2): 198-205 (1987) - Ross Clark, William T. Ziemba:
OR Practice - Playing the Turn-of-the-Year Effect with Index Futures. Oper. Res. 35(6): 799-813 (1987) - Miklós Csörgo, Sándor Csörgo:
Estimation of Percentile Residual Life. Oper. Res. 35(4): 598-606 (1987) - Carlos F. Daganzo:
The Break-Bulk Role of Terminals in Many-to-Many Logistic Networks. Oper. Res. 35(4): 543-555 (1987) - John J. Dinkel, Marietta J. Tretter:
An Interval Arithmetic Approach to Sensitivity Analysis in Geometric Programming. Oper. Res. 35(6): 859-866 (1987) - Gregory Dobson:
The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot Sizes. Oper. Res. 35(5): 764-771 (1987) - Gregory Dobson, Uday S. Karmarkar:
Competitive Location on a Network. Oper. Res. 35(4): 565-574 (1987) - Gary D. Eppen, R. Kipp Martin:
Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition. Oper. Res. 35(6): 832-848 (1987) - S. N. Ethier:
Improving on Bold Play at Craps. Oper. Res. 35(6): 814-819 (1987) - Bruce Faaland, Tom Schmitt:
Scheduling Tasks with Due Dates in a Fabrication/Assembly Process. Oper. Res. 35(3): 378-388 (1987) - Peter H. Farquhar, Yutaka Nakamura:
Constant Exchange Risk Properties. Oper. Res. 35(2): 206-214 (1987) - Brion N. Feinberg, Samuel S. Chiu:
A Method to Calculate Steady-State Distributions of Large Markov Chains by Aggregating States. Oper. Res. 35(2): 282-290 (1987) - Matteo Fischetti, Silvano Martello, Paolo Toth:
The Fixed Job Schedule Problem with Spread-Time Constraints. Oper. Res. 35(6): 849-858 (1987) - George S. Fishman:
The Distribution of Maximum Flow with Applications to Multistate Reliability Systems. Oper. Res. 35(4): 607-618 (1987) - J. David Fuller, R. G. Vickson:
The Optimal Timing of New Plants for Oil from the Alberta Tar Sands. Oper. Res. 35(5): 704-715 (1987)
skipping 62 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.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-07-02 11:41 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