Остановите войну!
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 13 matches
- 2010
- R. Chandrasekaran:
Santosh Narayan Kabadi 1956-2010. Algorithmic Oper. Res. 5(2) (2010) - Federico Della Croce, Vangelis Th. Paschos, Roberto Wolfler Calvo:
Approximating the metric 2-Peripatetic Salesman Problem. Algorithmic Oper. Res. 5(1): 13-20 (2010) - Brian C. Dean:
Speeding up Stochastic Dynamic Programming with Zero-Delay Convolution. Algorithmic Oper. Res. 5(2): 96-104 (2010) - Wei Ding, Yi Zhao:
An improved LS algorithm for the problem of scheduling multi groups of jobs on multi processors at the same speed. Algorithmic Oper. Res. 5(1): 34-38 (2010) - Martti Hamina, Matti Peltola:
Some Structural Properties of a Least Central Subtree of a Tree. Algorithmic Oper. Res. 5(2): 105-118 (2010) - Seyed Ahmad Hosseini, Hassan Salehi Fathabadi:
Minimum Cost Flow Problem on Dynamic Multi Generative Network flows. Algorithmic Oper. Res. 5(1): 39-48 (2010) - Tibor Illés, Marianna Nagy, Tamás Terlaky:
Polynomial Interior Point Algorithms for General Linear Complementarity Problems. Algorithmic Oper. Res. 5(1): 1-12 (2010) - Antje Kiesel, Céline Engelbeen:
Binary matrix decompositions without tongue-and-groove underdosage for radiation therapy planning. Algorithmic Oper. Res. 5(2): 119-132 (2010) - François-Xavier Meuwly, Bernard Ries, Nicolas Zufferey:
Solution Methods for a Scheduling Problem with Incompatibility and Precedence Constraints. Algorithmic Oper. Res. 5(2): 75-85 (2010) - Nora Touati Moungla, Lucas Létocart, Anass Nagih:
Solutions diversification in a column generation algorithm. Algorithmic Oper. Res. 5(2): 86-95 (2010) - Cécile Murat, Vangelis Th. Paschos:
Probabilistic optimization in graph-problems. Algorithmic Oper. Res. 5(1): 49-64 (2010) - Katta G. Murty, Mohammad R. Oskoorouchi:
Sphere Methods for LP. Algorithmic Oper. Res. 5(1): 21-33 (2010) - Javier Peña, Xavier Saynac, Juan Carlos Vera, Luis Fernando Zuluaga:
Computing general static-arbitrage bounds for European basket options via Dantzig-Wolfe decomposition. Algorithmic Oper. Res. 5(2): 65-74 (2010)
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-24 09:03 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