![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 32 matches
- 1977
- Pakorn Adulbhan, Mario T. Tabucanon:
Bicriterion linear programming. Comput. Oper. Res. 4(2): 147-153 (1977) - William W. Agresti:
Dynamic programming for computer register allocation. Comput. Oper. Res. 4(2): 101-110 (1977) - Paola Bertolazzi, Lucio Bianco, Salvatore Ricciardelli:
A method for determining the optimal districting in urban emergency services. Comput. Oper. Res. 4(1): 1-12 (1977) - Kenneth R. Chelst:
A guided tour through a maze: Computer aided sector design. Comput. Oper. Res. 4(3): 155-166 (1977) - Norman W. Chlosta, Leif Froberg:
Forecasting mail volume for production planning in a post office. Comput. Oper. Res. 4(4): 247-255 (1977) - K. Roscoe Davis, LeRoy F. Simmons:
Improving assembly line efficiency: A dynamic programming-heuristic approach. Comput. Oper. Res. 4(2): 75-87 (1977) - K. Roscoe Davis, James E. Walters:
Addressing the N/1 scheduling problem - A heuristic approach. Comput. Oper. Res. 4(2): 89-100 (1977) - James R. Evans, John J. Jarvis:
An out-of-kilter based heuristic for the integer multicommodity transportation problem. Comput. Oper. Res. 4(1): 13-20 (1977) - Saul I. Gass:
Evaluation of complex models. Comput. Oper. Res. 4(1): 27-35 (1977) - Winfried K. Grassmann
:
Transient solutions in markovian queueing systems. Comput. Oper. Res. 4(1): 47-53 (1977) - Jatinder N. D. Gupta
:
Introduction to the special postal issue. Comput. Oper. Res. 4(4): 233-234 (1977) - Jatinder N. D. Gupta
, LeRoy J. Krajewski:
Operations research in postal services - a survey. Comput. Oper. Res. 4(4): 235-246 (1977) - Baruch Halachimi, William R. Franta:
A diffusion approximate solution to the g/g/k queueing system. Comput. Oper. Res. 4(1): 37-46 (1977) - A. Höeg:
Planning the structure of the parcel flow in a postal logistics system. Comput. Oper. Res. 4(4): 279-285 (1977) - Jacob Intrator, Jacob Paroush:
Sensitivity analysis of the classical transportation problem. A combinatorial approach. Comput. Oper. Res. 4(3): 213-226 (1977) - Kazimir M. Jasinski, Trev J. Steggles:
Modelling letter delivery in town areas. Comput. Oper. Res. 4(4): 287-294 (1977) - Arshad M. Khan, Deepak Bammi:
Optimizing player earnings in professional tennis. Comput. Oper. Res. 4(2): 119-127 (1977) - J. S. H. Kornbluth:
The fuzzy dual: Information for the multiple objective decision-maker. Comput. Oper. Res. 4(1): 65-72 (1977) - Demetres D. Kouvatsos:
Mathematical methods for the modular design of computer systems. Comput. Oper. Res. 4(1): 55-63 (1977) - Benjamin Lev
, Jacob Intrator:
Application of vanishing variable methods to special structured transportation problems. Comput. Oper. Res. 4(1): 21-26 (1977) - Charles Ernest Love:
Purchase/replacement rules for decaying service facilities. Comput. Oper. Res. 4(2): 111-118 (1977) - Steven F. Maier, James H. Vander Weide:
A decision analysis approach to the computer lease-purchase decision. Comput. Oper. Res. 4(3): 167-172 (1977) - Patrick G. McKeown, David S. Rubin:
LPMPS: A student oriented preprocessor for MPS/360. Comput. Oper. Res. 4(3): 227-229 (1977) - M. I. McManus:
Optimum use of overtime in post offices. Comput. Oper. Res. 4(4): 271-278 (1977) - Laurence J. Moore, Sang M. Lee, Bernard W. Taylor III:
Combined continuous-discrete system simulation with GASP IV. Comput. Oper. Res. 4(2): 129-137 (1977) - J. P. Petersen:
A manual procedure for designing mailman-routes. Comput. Oper. Res. 4(4): 295-302 (1977) - Samuel J. Raff:
Preface. Comput. Oper. Res. 4(4): 231 (1977) - Stan Schenkerman:
Multi-attribute decision making using constrained criteria. Comput. Oper. Res. 4(2): 139-145 (1977) - Michael J. Showalter, LeRoy J. Krajewski, Larry P. Ritzman:
Manpower allocation in U.S. postal facilities: A heuristic approach. Comput. Oper. Res. 4(4): 257-269 (1977) - L. Douglas Smith, A. Wiggins:
A computer-based nurse scheduling system. Comput. Oper. Res. 4(3): 195-212 (1977)
skipping 2 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.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-26 07:30 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