Остановите войну!
for scientists:
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
- 2001
- B. Aghezzaf, T. Ouaderhman:
An interactive interior point algorithm for multiobjective linear programming problems. Oper. Res. Lett. 29(4): 163-170 (2001) - Tiru S. Arthanari, Usha Mohan:
On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem. Oper. Res. Lett. 29(3): 129-139 (2001) - Alper Atamtürk:
Flow pack facets of the single node fixed-charge flow polytope. Oper. Res. Lett. 29(3): 107-114 (2001) - Anantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani:
Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems. Oper. Res. Lett. 29(3): 99-106 (2001) - Tamer Boyaci, Guillermo Gallego:
Minimizing holding and ordering costs subject to a bound on backorders is as easy as solving a single backorder cost model. Oper. Res. Lett. 29(4): 187-192 (2001) - Joachim Breit, Günter Schmidt, Vitaly A. Strusevich:
Two-machine open shop scheduling with an availability constraint. Oper. Res. Lett. 29(2): 65-77 (2001) - Adriana Felicia Bumb:
An approximation algorithm for the maximization version of the two level uncapacitated facility location problem. Oper. Res. Lett. 29(4): 155-161 (2001) - Travis A. Dahl, Thomas R. Willemain:
The effect of long-memory arrivals on queue performance. Oper. Res. Lett. 29(3): 123-127 (2001) - Vladimir G. Deineko, Gerhard J. Woeginger:
Hardness of approximation of the discrete time-cost tradeoff problem. Oper. Res. Lett. 29(5): 207-210 (2001) - Leah Epstein:
Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios. Oper. Res. Lett. 29(2): 93-98 (2001) - Ismael R. de Farias Jr., George L. Nemhauser:
A family of inequalities for the generalized assignment polytope. Oper. Res. Lett. 29(2): 49-55 (2001) - Geert Jan Franx:
A simple solution for the M/D/c waiting time distribution. Oper. Res. Lett. 29(5): 221-229 (2001) - O. Rolando Gárciga, Alfredo N. Iusem, Benar Fux Svaiter:
On the need for hybrid steps in hybrid proximal point methods. Oper. Res. Lett. 29(5): 217-220 (2001) - Robert R. Goldberg, Jacob Shapiro:
Extending Graham's result on scheduling to other heuristics. Oper. Res. Lett. 29(4): 149-153 (2001) - Winfried K. Grassmann, Xin Chen, Brij R. K. Kashyap:
Optimal service rates for the state-dependent M/G/1 queues in steady state. Oper. Res. Lett. 29(2): 57-63 (2001) - Moshe Haviv:
The Aumann-Shapley price mechanism for allocating congestion costs. Oper. Res. Lett. 29(5): 211-215 (2001) - Han Hoogeveen, Gerhard J. Woeginger:
A very difficult scheduling problem with communication delays. Oper. Res. Lett. 29(5): 241-245 (2001) - Johann L. Hurink, Sigrid Knust:
List scheduling in a parallel machine environment with precedence constraints and setup times. Oper. Res. Lett. 29(5): 231-239 (2001) - Csanád Imreh:
Online strip packing with modifiable boxes. Oper. Res. Lett. 29(2): 79-85 (2001) - Philip M. Kaminsky, David Simchi-Levi:
Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates. Oper. Res. Lett. 29(3): 141-148 (2001) - George J. Kyparisis, Christos Koulamas:
A note on weighted completion time minimization in a flexible flow shop. Oper. Res. Lett. 29(1): 5-11 (2001) - Patrice Marcotte, Gilles Savard, Daoli Zhu:
A trust region algorithm for nonlinear bilevel programming. Oper. Res. Lett. 29(4): 171-179 (2001) - András Prékopa:
On the concavity of multivariate probability distribution functions. Oper. Res. Lett. 29(1): 1-4 (2001) - Rhonda Righter, J. George Shanthikumar:
Optimal ordering of operations in a manufacturing chain. Oper. Res. Lett. 29(3): 115-121 (2001) - Gaurav Singh:
Performance of critical path type algorithms for scheduling on parallel processors. Oper. Res. Lett. 29(1): 17-30 (2001) - Wolfgang Stadje, Dror Zuckerman:
A random walk model for a multi-component deteriorating system. Oper. Res. Lett. 29(5): 199-205 (2001) - Xiaoling Sun, Duan Li:
On the relationship between the integer and continuous solutions of convex programs. Oper. Res. Lett. 29(2): 87-92 (2001) - Levent Tunçel:
On the Slater condition for the SDP relaxations of nonconvex sets. Oper. Res. Lett. 29(4): 181-186 (2001) - Hande Yaman, Oya Ekin Karasan, Mustafa Ç. Pinar:
The robust spanning tree problem with interval data. Oper. Res. Lett. 29(1): 31-40 (2001) - Dequan Yue, Jinhua Cao:
Some results on successive failure times of a system with minimal instantaneous repairs. Oper. Res. Lett. 29(4): 193-197 (2001)
skipping 2 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-05-15 20:01 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