Остановите войну!
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 23 matches
- 1998
- Michel Balinski, Niousha Shahidi:
A simple approach to the product rate variation problem via axiomatics. Oper. Res. Lett. 22(4-5): 129-135 (1998) - Jonathan Barzilai:
On the decomposition of value functions. Oper. Res. Lett. 22(4-5): 159-170 (1998) - Jack Brimberg, Reuven Chen, Doron Chen:
Accelerating convergence in the Fermat-Weber location problem. Oper. Res. Lett. 22(4-5): 151-157 (1998) - Fabián A. Chudak, Michel X. Goemans, Dorit S. Hochbaum, David P. Williamson:
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs. Oper. Res. Lett. 22(4-5): 111-118 (1998) - Geir Dahl:
Polytopes related to the linfinity-distance between vectors. Oper. Res. Lett. 22(1): 49-54 (1998) - Vladimir G. Deineko, Gerhard J. Woeginger:
A solvable case of the quadratic assignment problem. Oper. Res. Lett. 22(1): 13-17 (1998) - J. David Fuller, Frederic H. Murphy:
On the convergence of the decoupling algorithm for multiperiod equilibrium models. Oper. Res. Lett. 22(1): 33-39 (1998) - Ubaldo M. García-Palomares:
A superlinearly convergent projection algorithm for solving the convex inequality problem. Oper. Res. Lett. 22(2-3): 97-103 (1998) - Pierre Hansen, Nenad Mladenovic, Éric D. Taillard:
Heuristic solution of the multisource Weber problem as a p-median problem. Oper. Res. Lett. 22(2-3): 55-62 (1998) - Matthieu van der Heijden, Ton G. de Kok:
Estimating stock levels in periodic review inventory systems. Oper. Res. Lett. 22(4-5): 179-182 (1998) - Satoru Iwata, Tomomi Matsui, S. Thomas McCormick:
A fast bipartite network flow algorithm for selective assembly. Oper. Res. Lett. 22(4-5): 137-143 (1998) - Michael Jünger, Stefan Thienel:
Introduction to ABACUS - a branch-and-cut system. Oper. Res. Lett. 22(2-3): 83-95 (1998) - DaeSoo Kim, Won J. Lee:
Optimal coordination strategies for production and marketing decisions. Oper. Res. Lett. 22(1): 41-47 (1998) - Bettina Klinz, Gerhard J. Woeginger:
One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs. Oper. Res. Lett. 22(4-5): 119-127 (1998) - Avital Lann, Gur Mosheiov, Yosef Rinott:
Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps. Oper. Res. Lett. 22(2-3): 63-68 (1998) - Andrew Lim:
The berth planning problem. Oper. Res. Lett. 22(2-3): 105-110 (1998) - Guo-Hui Lin, En-Yu Yao, Yong He:
Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times. Oper. Res. Lett. 22(2-3): 75-81 (1998) - Kamlesh Mathur:
An integer-programming-based heuristic for the balanced loading problem. Oper. Res. Lett. 22(1): 19-25 (1998) - Anuj Mehrotra, Michael A. Trick:
Cliques and clustering: A combinatorial approach. Oper. Res. Lett. 22(1): 1-12 (1998) - Fred J. Rispoli:
The monotonic diameter of traveling salesman polytopes. Oper. Res. Lett. 22(2-3): 69-73 (1998) - Steven S. Seiden:
Randomized online interval scheduling. Oper. Res. Lett. 22(4-5): 171-177 (1998) - Jos F. Sturm, Shuzhong Zhang:
On the long-step path-following method for semidefinite programming. Oper. Res. Lett. 22(4-5): 145-150 (1998) - Gordon E. Willmot:
On a class of approximations for ruin and waiting time probabilities. Oper. Res. Lett. 22(1): 27-32 (1998)
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-27 13:51 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