![](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 30 matches
- 1978
- Niv Ahituv, Israel Borovits, Seev Neumann:
Selecting a job mix for running a benchmark by using an integer programming model. Comput. Oper. Res. 5(1): 73-79 (1978) - Mokhtar S. Bazaraa:
An infeasibility pricing algorithm for the multicommodity minimum cost flow problem. Comput. Oper. Res. 5(4): 251-261 (1978) - Achi Brandt, Jacob Intrator:
Fast algorithms for long transportation problems. Comput. Oper. Res. 5(4): 263-271 (1978) - Jimmy Chan, Brian Conolly:
Comparative effectiveness of certain queueing systems with adaptive demand and service mechanisms. Comput. Oper. Res. 5(3): 187-196 (1978) - Perino M. Dearing, James P. Jarvis:
A location model with queueing constraints. Comput. Oper. Res. 5(4): 273-277 (1978) - John J. Dinkel, Gary A. Kochenberger, Y. Seppälä:
Resource allocation in computer networks by a regional accessibility model. Comput. Oper. Res. 5(2): 139-147 (1978) - Robert G. Dyson
, Gillian Swaithes:
A global algorithm for minimax solutions to a stochastic programming problem. Comput. Oper. Res. 5(3): 197-204 (1978) - Stephen J. Fineman, Asha S. Kapadia:
An analysis of the logistics of supplying and processing sterilized items in hospitals. Comput. Oper. Res. 5(1): 47-54 (1978) - Moshe Friedman, Jeffrey L. Winter:
A Study of the infinite horizon 'solution' of inventory lot size models with a linear demand function. Comput. Oper. Res. 5(2): 157-160 (1978) - Bezalel Gavish:
On obtaining the 'best' multipliers for a lagrangean relaxation for integer programming. Comput. Oper. Res. 5(1): 55-71 (1978) - Bezalel Gavish, Paul J. Schweitzer, Eliezer Shlifer:
Assigning buses to schedules in a metropolitan area. Comput. Oper. Res. 5(2): 129-138 (1978) - Winfried K. Grassmann:
Transient solutions in Markovian Queueing Systems. Comput. Oper. Res. 5(2): 161 (1978) - Jatinder N. D. Gupta
:
A search algorithm for the traveling salesman problem. Comput. Oper. Res. 5(4): 243-250 (1978) - Baruch Halachmi:
On approximating the generalized occupancy of the G/M/K queueing system. Comput. Oper. Res. 5(1): 81-87 (1978) - Baruch Halachmi:
On approximating the conditional wait process of general multiserver queueing systems. Comput. Oper. Res. 5(2): 101-107 (1978) - Baruch Halachmi:
The fokker-planck equation as an approximating formula for the G/M/K queueing system. Comput. Oper. Res. 5(3): 179-186 (1978) - Edward L. Hannan:
Allocation of library funds for books and standing orders - a multiple objective formulation. Comput. Oper. Res. 5(2): 109-114 (1978) - Marvin Hersh, Shaul P. Ladany:
Optimal seat allocation for flights with one intermediate stop. Comput. Oper. Res. 5(1): 31-37 (1978) - Jacob Intrator, Jacob Paroush:
Improving loops and vanishing variables in long transportation problems. Comput. Oper. Res. 5(2): 123-128 (1978) - Arnold L. Knoll, Abraham Engelberg:
Weighting multiple objectives - the churchman-ackoff technique revisited. Comput. Oper. Res. 5(3): 165-177 (1978) - Shaul P. Ladany, Efraim Turban:
A simulation of emergency rooms. Comput. Oper. Res. 5(2): 89-100 (1978) - Santi B. Lahiri:
A heuristic approach to commodity purchasing. Comput. Oper. Res. 5(2): 115-122 (1978) - Richard C. Larson, Evelyn A. Franck:
Evaluating dispatching consequences of automatic vehicle location in emergency services. Comput. Oper. Res. 5(1): 11-30 (1978) - Sang M. Lee, Edward R. Clayton, Bernard W. Taylor III:
A goal programming approach to multi-period production line scheduling. Comput. Oper. Res. 5(3): 205-211 (1978) - Bo W. Lin, Elsayed A. Elsayed:
A general solution for multichannel queueing systems with ordered entry. Comput. Oper. Res. 5(4): 219-225 (1978) - Bayliss C. McInnis, Bartholomew P. Hsi, Asha S. Kapadia:
A stochastic model of port elevator capacity. Comput. Oper. Res. 5(3): 213-215 (1978) - Laurence J. Moore, Bernard W. Taylor III, Sang M. Lee:
Analysis of a transshipment problem with multiple conflicting objectives. Comput. Oper. Res. 5(1): 39-46 (1978) - Marc J. Schniederjans, N. K. Kwak:
A Simulated transportation problem for improved operational planning: An application in the trucking industry. Comput. Oper. Res. 5(2): 149-155 (1978) - Theodor J. Stewart:
A criterion for optimality of design of evop-type experiments - II. Modified criterion for non-quadratic response surfaces. Comput. Oper. Res. 5(1): 1-9 (1978) - James G. Taylor, Gerald G. Brown:
Numerical determination of the parity-condition parameter for lanchester-type equations of modern warfare. Comput. Oper. Res. 5(4): 227-242 (1978)
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-08-20 00:14 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