![](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 81 matches
- 1991
- Saligrama R. Agnihothri
:
Complementarity between the finite capacity and finite source queuing systems. Comput. Oper. Res. 18(2): 183-188 (1991) - Bahram Alidaee:
Single machine scheduling with nonlinear cost functions. Comput. Oper. Res. 18(3): 317-322 (1991) - Alireza Ardalan:
Combined optimal price and optimal inventory replenishment policies when a sale results in increase in demand. Comput. Oper. Res. 18(8): 721-730 (1991) - Robert T. Barrett, R. Lawrence LaForge:
A study of replanning frequencies in a material requirements planning system. Comput. Oper. Res. 18(6): 569-578 (1991) - Lawrence Bodin, Azita Kashani:
The zone hopping problem. Comput. Oper. Res. 18(1): 75-86 (1991) - Noel Bryson:
Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint. Comput. Oper. Res. 18(2): 129-140 (1991) - Laura Ignizio Burke:
Introduction to artificial neural systems for pattern recognition. Comput. Oper. Res. 18(2): 211-220 (1991) - B. V. Cadambi:
One machine scheduling to minimize expected mean tardiness - part I. Comput. Oper. Res. 18(8): 787-796 (1991) - Wilfred Candler:
Coal blending - with acceptance sampling. Comput. Oper. Res. 18(7): 591-596 (1991) - Tom M. Cavalier, Brian J. Melloy:
An iterative linear programming solution to the Euclidean regression model. Comput. Oper. Res. 18(8): 655-661 (1991) - Avishai Ceder
:
A procedure to adjust transit trip departure times through minimizing the maximum headway. Comput. Oper. Res. 18(5): 417-431 (1991) - Amiya K. Chakravarty, G. E. Martin:
Operational economies of a process positioning determinant. Comput. Oper. Res. 18(6): 515-530 (1991) - Mohan L. Chaudhry, Umesh Chandra Gupta, Manju Agarwal:
On exact computational analysis of distributions of numbers in systems for M/G/1/N + 1 and GI/M/1/N + 1 queues using roots. Comput. Oper. Res. 18(8): 679-694 (1991) - Kah Mun Cheh, Jeffrey B. Goldberg, Ronald G. Askin:
A note on the effect of neighborhood structure in simulated annealing. Comput. Oper. Res. 18(6): 537-547 (1991) - James A. Chisman:
Preparing students and new practitioners for the real-world of OR/MS. Comput. Oper. Res. 18(7): 585-589 (1991) - Kun-Jen Chung, Matthew J. Sobel:
Linear programming solutions of the truncated moment problem. Comput. Oper. Res. 18(5): 477-485 (1991) - Panos Constantopoulos
, Fred C. Schweppe, Richard C. Larson:
Estia: A real-time consumer control scheme for space conditioning usage under spot electricity pricing. Comput. Oper. Res. 18(8): 751-765 (1991) - Lee Josvanger Crowder, Vincent A. Sposito:
Sequential linear goal programming: Implementation via MPSX/370E. Comput. Oper. Res. 18(3): 291-296 (1991) - Prabuddha De, Jay B. Ghosh, Charles E. Wells:
On the minimization of the weighted number of tardy jobs with random processing times and deadline. Comput. Oper. Res. 18(5): 457-463 (1991) - Prabuddha De, Jay B. Ghosh, Charles E. Wells:
Scheduling to minimize weighted earliness and tardiness about a common due-date. Comput. Oper. Res. 18(5): 465-475 (1991) - Prabuddha De, Jay B. Ghosh, Charles E. Wells:
Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine. Comput. Oper. Res. 18(8): 717-720 (1991) - Martin Desrochers, T. W. Verhoog:
A new heuristic for the fleet size and mix vehicle routing problem. Comput. Oper. Res. 18(3): 263-274 (1991) - Bernard Dickman, Yonah Wilamowsky, Sheldon Epstein:
Optimal common due-date with limited completion time. Comput. Oper. Res. 18(1): 125-127 (1991) - Parthasarati Dileepan, Tapan Sen:
Job lateness in a two-machine flowshop with setup times separated. Comput. Oper. Res. 18(6): 549-556 (1991) - Muhammad El-Taha, John R. Heath:
A model of channel allocation in multichannel local networks. Comput. Oper. Res. 18(3): 297-306 (1991) - Abid M. Elabdalla:
A note on multikey sorting using modified binary insertion trees. Comput. Oper. Res. 18(6): 507-513 (1991) - Salah E. Elmaghraby:
Manufacturing capacity and its measurement: A critical evaluation. Comput. Oper. Res. 18(7): 615-627 (1991) - Thomas A. Feo, Krishnamurthi Venkatraman, Jonathan F. Bard:
A GRASPTM for a difficult single machine scheduling problem, . Comput. Oper. Res. 18(8): 635-643 (1991) - Saul I. Gass:
Military manpower planning models. Comput. Oper. Res. 18(1): 65-73 (1991) - Saul I. Gass:
OR in the real world: How things go wrong. Comput. Oper. Res. 18(7): 629-632 (1991)
skipping 51 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-08-20 13:43 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