Остановите войну!
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 14 matches
- 2018
- Teobaldo Bulhões, Ruslan Sadykov, Eduardo Uchoa:
A branch-and-price algorithm for the Minimum Latency Problem. Comput. Oper. Res. 93: 66-78 (2018) - José Coelho, Mario Vanhoucke:
An exact composite lower bound strategy for the resource-constrained project scheduling problem. Comput. Oper. Res. 93: 135-150 (2018) - Claudia D'Ambrosio, Silvano Martello, Luca Mencarelli:
Relaxations and heuristics for the multiple non-linear separable knapsack problem. Comput. Oper. Res. 93: 79-89 (2018) - Edoardo Fadda, Guido Perboli, Roberto Tadei:
Customized multi-period stochastic assignment problem for social engagement and opportunistic IoT. Comput. Oper. Res. 93: 41-50 (2018) - Matteo Fischetti, Michele Monaci, Domenico Salvagnin:
SelfSplit parallelization for mixed-integer linear programming. Comput. Oper. Res. 93: 101-112 (2018) - Jordi Pereira:
The robust (minmax regret) assembly line worker assignment and balancing problem. Comput. Oper. Res. 93: 27-40 (2018) - Armando Honorio Pereira, Sebastián Urrutia:
Formulations and algorithms for the Pickup and Delivery Traveling Salesman Problem with Multiple Stacks. Comput. Oper. Res. 93: 1-14 (2018) - Shahrzad M. Pour, John H. Drake, Edmund K. Burke:
A choice function hyper-heuristic framework for the allocation of maintenance tasks in Danish railways. Comput. Oper. Res. 93: 15-26 (2018) - Maria I. Restrepo, Bernard Gendron, Louis-Martin Rousseau:
Combining Benders decomposition and column generation for multi-activity tour scheduling. Comput. Oper. Res. 93: 151-165 (2018) - Stefan Schwerdfeger, Rico Walter:
Improved algorithms to minimize workload balancing criteria on identical parallel machines. Comput. Oper. Res. 93: 123-134 (2018) - Christian Tilk, Stefan Irnich:
Combined column-and-row-generation for the optimal communication spanning tree problem. Comput. Oper. Res. 93: 113-122 (2018) - Shunji Umetani, Masanao Arakawa, Mutsunori Yagiura:
Relaxation heuristics for the set multicover problem with generalized upper bound constraints. Comput. Oper. Res. 93: 90-100 (2018) - Mike Mingcheng Wei, Fuqiang Zhang:
Recent research developments of strategic consumer behavior in operations management. Comput. Oper. Res. 93: 166-176 (2018) - Tadeu K. Zubaran, Marcus Ritt:
An effective heuristic algorithm for the partial shop scheduling problem. Comput. Oper. Res. 93: 51-65 (2018)
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 09:55 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