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 101 matches
- 1975
- Robert A. Abrams, Adi Ben-Israel:
Technical Note - Optimality Conditions and Recession Cones. Oper. Res. 23(3): 549-553 (1975) - Joachim H. Ahrens, Gerd Finke:
Merging and Sorting Applied to the Zero-One Knapsack Problem. Oper. Res. 23(6): 1099-1109 (1975) - R. L. Arms, D. W. Grissmer, Jerome Bracken, L. A. Lyons, Frederic A. Miercort, N. M. Smith:
Strategic Weapons Exchange Models. Oper. Res. 23(2): 342-357 (1975) - Ronald D. Armstrong, Joseph L. Balintfy:
A Chance Constrained Multiple Choice Programming Algorithm. Oper. Res. 23(3): 494-510 (1975) - Donald Aucamp:
Technical Note - Comment on "The Random Nature of Stock-Market Prices" Authored by Barrett and Wright. Oper. Res. 23(3): 587-591 (1975) - Kenneth R. Baker:
A Comparative Study of Flow-Shop Algorithms. Oper. Res. 23(1): 62-73 (1975) - Kenneth R. Baker:
Technical Note - An Elimination Method for the Flow-Shop Problem. Oper. Res. 23(1): 159-162 (1975) - Egon Balas, Manfred Padberg:
On the Set-Covering Problem: II. An Algorithm for Set Partitioning. Oper. Res. 23(1): 74-90 (1975) - Joseph L. Balintfy, William J. Duffy, Prabhakant Sinha:
Letter to the Editor - More about Modeling Food Preferences. Oper. Res. 23(4): 839-840 (1975) - Mokhtar S. Bazaraa, Jamie J. Goode:
A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem. Oper. Res. 23(1): 150-158 (1975) - Avraham Beja, Esther Sid:
Optimal Priority Assignment with Heterogeneous Waiting Costs. Oper. Res. 23(1): 107-117 (1975) - Barry Belkin:
Technical Note - On the Rate of Expansion of Gamma Search Plans. Oper. Res. 23(5): 1033-1037 (1975) - Barry Belkin:
Application of a Functional Equation to a Class of Stochastic Detection Models. Oper. Res. 23(6): 1143-1154 (1975) - Colin E. Bell:
Technical Note - Turning Off a Server with Customers Present: Is This Any Way to Run an M/M/c Queue with Removable Servers? Oper. Res. 23(3): 571-574 (1975) - P. H. Benson:
Letter to the Editor - Some Implications of Modeling Food Preferences over Time. Oper. Res. 23(4): 838-839 (1975) - Jerome Bracken, James E. Falk, Alan F. Karr:
Two Models for Optimal Allocation of Aircraft Sorties. Oper. Res. 23(5): 979-995 (1975) - P. J. Burke:
Technical Note - Delays in Single-Server Queues with Batch Input. Oper. Res. 23(4): 830-833 (1975) - A. Victor Cabot:
Technical Note - On the Generalized Lattice Point Problem and Nonlinear Programming. Oper. Res. 23(3): 565-571 (1975) - Frank J. Cesario:
Letter to the Editor - An Interesting Test Problem for Nonlinear Programming Algorithms. Oper. Res. 23(3): 599-601 (1975) - Wade D. Cook, C. A. Field, Michael J. L. Kirby:
Infinite Linear Programming in Games with Partial Information. Oper. Res. 23(5): 996-1010 (1975) - Wade D. Cook, Michael J. L. Kirby, S. L. Mehndiratta:
A Linear Fractional Max-Min Problem. Oper. Res. 23(3): 511-521 (1975) - Michael A. Crane, Donald L. Iglehart:
Simulating Stable Stochastic Systems: III. Regenerative Processes and Discrete-Event Simulations. Oper. Res. 23(1): 33-45 (1975) - Cyrus Derman, Edward J. Ignall:
Technical Note - On the Stochastic Ordering of Markov Chains. Oper. Res. 23(3): 574-576 (1975) - Cyrus Derman, G. J. Lieberman, Sheldon M. Ross:
A Stochastic Sequential Allocation Model. Oper. Res. 23(6): 1120-1130 (1975) - P. J. Doulliez, M. R. Rao:
Optimal Network Capacity Planning: A Shortest-Path Scheme. Oper. Res. 23(4): 810-818 (1975) - George T. Duncan:
Optimal Diagnostic Questionnaires. Oper. Res. 23(1): 22-32 (1975) - John Duncan, Lawrence W. Scott:
A Branch-and-Bound Algorithm for Pagination. Oper. Res. 23(2): 240-259 (1975) - Bruce H. Faaland, Frederick S. Hillier:
The Accelerated Bound-and-Scan Algorithm for Integer Programming. Oper. Res. 23(3): 406-433 (1975) - Peter H. Farquhar:
A Fractional Hypercube Decomposition Theorem for Multiattribute Utility Functions. Oper. Res. 23(5): 941-967 (1975) - Peter C. Fishburn, Ralph L. Keeney:
Generalized Utility Independence and Some Implications. Oper. Res. 23(5): 928-940 (1975)
skipping 71 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-10-08 09: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