![](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 31 matches
- 2000
- Julián Aráoz:
Forward chaining is simple(x). Oper. Res. Lett. 26(1): 23-26 (2000) - Francisco Barahona:
On the k-cut problem. Oper. Res. Lett. 26(3): 99-105 (2000) - Gerald G. Brown, Robert F. Dell, Michael P. Olson:
Valid integer polytope (VIP) penalties for branch-and-bound enumeration. Oper. Res. Lett. 26(3): 117-126 (2000) - T. C. Edwin Cheng
, Guoqing Wang:
An improved heuristic for two-machine flowshop scheduling with an availability constraint. Oper. Res. Lett. 26(5): 223-229 (2000) - Attila Csenki:
Asymptotics for renewal-reward processes with retrospective reward structure. Oper. Res. Lett. 26(5): 201-209 (2000) - Leah Epstein, Jirí Sgall
:
A lower bound for on-line scheduling on uniformly related machines. Oper. Res. Lett. 26(1): 17-22 (2000) - Gianpaolo Ghiani
, Gennaro Improta:
An algorithm for the hierarchical Chinese postman problem. Oper. Res. Lett. 26(1): 27-32 (2000) - Michel X. Goemans, Joel Wein, David P. Williamson:
A 1.47-approximation algorithm for a preemptive single-machine scheduling problem. Oper. Res. Lett. 26(4): 149-154 (2000) - Luigi Grippo, Marco Sciandrone:
On the convergence of the block nonlinear Gauss-Seidel method under convex constraints. Oper. Res. Lett. 26(3): 127-136 (2000) - Michael M. Güntzer, Dieter Jungnickel:
Approximate minimization algorithms for the 0/1 Knapsack and Subset-Sum Problem. Oper. Res. Lett. 26(2): 55-66 (2000) - Qi-Ming He:
Classification of Markov processes of M/G/1 type with a tree structure and its applications to queueing models. Oper. Res. Lett. 26(2): 67-80 (2000) - Allen G. Holder, Richard J. Caron
:
Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights. Oper. Res. Lett. 26(2): 49-54 (2000) - Frank K. Hwang, Shmuel Onn
, Uriel G. Rothblum:
Linear-shaped partition problems. Oper. Res. Lett. 26(4): 159-163 (2000) - Christos Koulamas, George J. Kyparisis:
Scheduling on uniform parallel machines to minimize maximum lateness. Oper. Res. Lett. 26(4): 175-179 (2000) - Siriphong Lawphongpanich:
Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints. Oper. Res. Lett. 26(1): 33-41 (2000) - Emily Larson Luebke, J. Scott Provan:
On the structure and complexity of the 2-connected Steiner network problem in the plane. Oper. Res. Lett. 26(3): 111-116 (2000) - Henrique Pacca Loureiro Luna, P. Mahey:
Bounds for global optimization of capacity expansion and flow assignment problems. Oper. Res. Lett. 26(5): 211-216 (2000) - Alfred Müller
:
On the waiting times in queues with dependency between interarrival and service times. Oper. Res. Lett. 26(1): 43-47 (2000) - David Perry, Morton J. M. Posner:
A correlated M/G/1-type queue with randomized server repair and maintenance modes. Oper. Res. Lett. 26(3): 137-147 (2000) - Y. Salama:
Optimal control of a simple manufacturing system with restarting costs. Oper. Res. Lett. 26(1): 9-16 (2000) - Susan M. Sanchez, Prabhudev Konana:
Efficient data allocation for frequency domain experiments. Oper. Res. Lett. 26(2): 81-89 (2000) - Hanif D. Sherali, Gyunghyun Choi, Cihan H. Tuncbilek:
A variable target value method for nondifferentiable optimization. Oper. Res. Lett. 26(1): 1-8 (2000) - Jeffrey B. Sidney, Chris N. Potts, Chelliah Sriskandarajah:
A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups. Oper. Res. Lett. 26(4): 165-173 (2000) - Vitaly A. Strusevich:
Group technology approach to the open shop scheduling problem with batch setup times. Oper. Res. Lett. 26(4): 181-192 (2000) - Maxim Sviridenko:
Worst-case analysis of the greedy algorithm for a generalization of the maximum p-facility location problem. Oper. Res. Lett. 26(4): 193-197 (2000) - Ruud H. Teunter, Edo S. Van der Poort:
The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges. Oper. Res. Lett. 26(2): 91-98 (2000) - Lars Thorlund-Petersen:
Comparison of probability measures: Dominance of the third degree. Oper. Res. Lett. 26(5): 237-245 (2000) - Henk C. Tijms, R. Veldman:
A fast algorithm for the transient reward distribution in continuous-time Markov chains. Oper. Res. Lett. 26(4): 155-158 (2000) - Gerhard J. Woeginger:
A comment on scheduling on uniform machines under chain-type precedence constraints. Oper. Res. Lett. 26(3): 107-109 (2000) - Guochuan Zhang
, Xiaoqiang Cai, C. K. Wong:
Linear time-approximation algorithms for bin packing. Oper. Res. Lett. 26(5): 217-222 (2000)
skipping 1 more match
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-17 17:40 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