Остановите войну!
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 88 matches
- 1981
- Sven Axsäter:
Aggregation of Product Data for Hierarchical Production Planning. Oper. Res. 29(4): 744-756 (1981) - Yair M. Babad:
Pricing Model for a Computer Center. Oper. Res. 29(1): 75-94 (1981) - J. Wesley Barnes, Lawrence K. Vanston:
Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs. Oper. Res. 29(1): 146-160 (1981) - Arnold Barnett:
The Deterrent Effect of Capital Punishment: A Test of Some Recent Studies. Oper. Res. 29(2): 346-370 (1981) - Richard S. Barr, Fred W. Glover, Darwin Klingman:
A New Optimization Method for Large Scale Fixed Charge Transportation Problems. Oper. Res. 29(3): 448-463 (1981) - John J. Bartholdi III:
A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering. Oper. Res. 29(3): 501-510 (1981) - Gabriel R. Bitran, Elizabeth A. Haas, Arnoldo C. Hax:
Hierarchical Production Planning: A Single Stage System. Oper. Res. 29(4): 717-743 (1981) - Robert G. Bland, Donald Goldfarb, Michael J. Todd:
Feature Article - The Ellipsoid Method: A Survey. Oper. Res. 29(6): 1039-1091 (1981) - Robert H. Bonczek, Clyde W. Holsapple, Andrew B. Whinston:
A Generalized Decision Support System Using Predicate Calculus and Network Data Base Management. Oper. Res. 29(2): 263-281 (1981) - Richard N. Burns, G. Steiner:
Single Machine Scheduling with Series-Parallel Precedence Constraints. Oper. Res. 29(6): 1195-1207 (1981) - Hung-Po Chao:
Exhaustible Resource Models: The Value of Information. Oper. Res. 29(5): 903-923 (1981) - Richard B. Chase:
The Customer Contact Approach to Services: Theoretical Bases and Practical Extensions. Oper. Res. 29(4): 698-706 (1981) - Yookun Cho, Sartaj Sahni:
Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops. Oper. Res. 29(3): 511-522 (1981) - Terrence E. Daniel, Henry M. Goldberg:
Dynamic Equilibrium Energy Modeling: The Canadian BALANCE Model. Oper. Res. 29(5): 829-852 (1981) - Andrew F. Daughety, Mark A. Turnquist:
Budget Constrained Optimization of Simulation Models via Estimation of Their Response Surfaces. Oper. Res. 29(3): 485-500 (1981) - Michael A. H. Dempster, Marshall L. Fisher, L. Jansen, B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Analytical Evaluation of Hierarchical Planning Systems. Oper. Res. 29(4): 707-716 (1981) - Joseph H. Discenza, Lawrence D. Stone:
Optimal Survivor Search with Multiple States. Oper. Res. 29(2): 309-323 (1981) - Zvi Drezner:
Technical Note - On Location Dominance on Spherical Surfaces. Oper. Res. 29(6): 1218-1219 (1981) - Harald Dyckhoff:
A New Linear Programming Approach to the Cutting Stock Problem. Oper. Res. 29(6): 1092-1104 (1981) - John M. Einbu:
Technical Note - Extension of the Luss-Gupta Resource Allocation Algorithm by Means of First Order Approximation Techniques. Oper. Res. 29(3): 621-626 (1981) - Richard V. Evans:
Markov Chain Design Problems. Oper. Res. 29(5): 959-970 (1981) - Bruce H. Faaland:
Technical Note - The Multiperiod Knapsack Problem. Oper. Res. 29(3): 612-616 (1981) - Peter H. Farquhar, Peter C. Fishburn:
Equivalences and Continuity in Multivalent Preference Structures. Oper. Res. 29(2): 282-293 (1981) - C. O. Fong, V. Srinivasan:
The Multiregion Dynamic Capacity Expansion Problem, Part I. Oper. Res. 29(4): 787-799 (1981) - C. O. Fong, V. Srinivasan:
The Multiregion Dynamic Capacity Expansion Problem, Part II. Oper. Res. 29(4): 800-816 (1981) - Brant E. Fries, Vijay P. Marathe:
Determination of Optimal Variable-Sized Multiple-Block Appointment Systems. Oper. Res. 29(2): 324-345 (1981) - Kevin D. Glazebrook, J. C. Gittins:
On Single-Machine Scheduling with Precedence Relations and Linear or Discounted Costs. Oper. Res. 29(1): 161-173 (1981) - Winfried K. Grassmann:
Technical Note - The Optimal Estimation of the Expected Number in a M/D/∞ Queueing System. Oper. Res. 29(6): 1208-1211 (1981) - Stephen C. Graves:
A Review of Production Scheduling. Oper. Res. 29(4): 646-675 (1981) - Donald Gross, John F. Ince:
The Machine Repair Problem with Heterogeneous Populations. Oper. Res. 29(3): 532-549 (1981)
skipping 58 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-17 02:57 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