Остановите войну!
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 85 matches
- 1969
- Igal Adiri, Benjamin Avi-Itzhak:
A Time-Sharing Model with Many Queues. Oper. Res. 17(6): 1077-1089 (1969) - Egon Balas:
Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm. Oper. Res. 17(6): 941-957 (1969) - C. Bernard Barfoot:
The Lanchester Attrition-Rate Coefficient: Some Comments on Seth Bonder's Paper and a Suggested Alternate Method. Oper. Res. 17(5): 888-894 (1969) - John M. Bennett, David R. Green:
Letter to the Editor - An Approach to Some Structured Linear Programming Problems. Oper. Res. 17(4): 749-750 (1969) - M. N. Bhattacharyya:
Optimum Allocation of Stand-by Systems. Oper. Res. 17(2): 337-343 (1969) - J. F. Bithell:
A Class of Discrete-Time Models for the Study of Hospital Admission Systems. Oper. Res. 17(1): 48-69 (1969) - Alfred Blumstein, Richard Larson:
Models of a Total Criminal Justice System. Oper. Res. 17(2): 199-232 (1969) - Joseph L. Bower:
Systems Analysis for Social Decisions. Oper. Res. 17(6): 927-940 (1969) - Israel Brosh:
Preemptive Priority Assignment in Multichannel Systems. Oper. Res. 17(3): 526-535 (1969) - P. J. Burke:
Letter to the Editor - The Dependence of Sojourn Times in Tandem M/M/S Queues. Oper. Res. 17(4): 754-755 (1969) - Mehmet I. Celebiler:
A Probabilistic Approach to Solving Assignment Problems. Oper. Res. 17(6): 993-1004 (1969) - L. E. N. Delbrouck:
A Multiserver Queue with Enforced Idle Times. Oper. Res. 17(3): 506-518 (1969) - J. F. Desler, S. Louis Hakimi:
A Graph-Theoretic Approach to a Class of Integer-Programming Problems. Oper. Res. 17(6): 1017-1033 (1969) - Edward N. Dodson:
Cost-Effectiveness in Urban Transportation. Oper. Res. 17(3): 373-394 (1969) - Stuart E. Dreyfus:
An Appraisal of Some Shortest-Path Algorithms. Oper. Res. 17(3): 395-412 (1969) - L. Durr:
A Single-Server Priority Queuing System with General Holding Times, Poisson Input, and Reverse-Order-of-Arrival Queuing Discipline. Oper. Res. 17(2): 351-358 (1969) - Richard M. Durstine, Russell G. Davis:
Letter to the Editor - Educational Planning in Developing Countries - A Possible Role for Operations Research. Oper. Res. 17(5): 911-915 (1969) - Samuel Eilon:
Letter to the Editor - A Simpler Proof of L = λW. Oper. Res. 17(5): 915-917 (1969) - Hamilton Emmons:
One-Machine Sequencing to Minimize Certain Functions of Job Tardiness. Oper. Res. 17(4): 701-715 (1969) - Joseph H. Engel:
Brains and Personality. Oper. Res. 17(5): 761-769 (1969) - Ernest G. Enns:
Some Waiting-Time Distributions for Queues with Multiple Feedback and Priorities. Oper. Res. 17(3): 519-525 (1969) - Peter C. Fishburn:
Information Analysis Without States of the World. Oper. Res. 17(3): 413-424 (1969) - Bennett Fox:
Letter to the Editor - Finding Minimal Cost-Time Ratio Circuits. Oper. Res. 17(3): 546-551 (1969) - H. Frank:
Shortest Paths in Probabilistic Graphs. Oper. Res. 17(4): 583-599 (1969) - Robert S. Garfinkel, George L. Nemhauser:
The Set-Partitioning Problem: Set Covering with Equality Constraints. Oper. Res. 17(5): 848-856 (1969) - Arthur M. Geoffrion:
An Improved Implicit Enumeration Approach for Integer Programming. Oper. Res. 17(3): 437-454 (1969) - P. M. Ghare, R. E. Taylor:
Optimal Redundancy for Reliability in Series Systems. Oper. Res. 17(5): 838-847 (1969) - Floyd J. Gould, H. Pashner:
Closure of the Right-Hand-Side Set for Systems of Nonlinear Inequalities. Oper. Res. 17(5): 883-887 (1969) - Richard C. Grinold:
Letter to the Editor - A Note on Multicommodity Max-Flow. Oper. Res. 17(4): 755 (1969) - Peter L. Hammer, Sergiu Rudeanu:
Pseudo-Boolean Programming. Oper. Res. 17(2): 233-261 (1969)
skipping 55 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-07-24 07:28 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