Остановите войну!
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 15 matches
- 2019
- Dalia Attia, Reinhard Bürgy, Guy Desaulniers, François Soumis:
A decomposition-based heuristic for large employee scheduling problems with inter-department transfers. EURO J. Comput. Optim. 7(4): 325-357 (2019) - Timo Berthold, Andrea Lodi, Domenico Salvagnin:
Ten years of feasibility pump, and counting. EURO J. Comput. Optim. 7(1): 1-14 (2019) - Christina Büsing, Sebastian Goderbauer, Arie M. C. A. Koster, Manuel Kutschka:
Formulations and algorithms for the recoverable Γ-robust knapsack problem. EURO J. Comput. Optim. 7(1): 15-45 (2019) - François Clautiaux, Ruslan Sadykov, François Vanderbeck, Quentin Viaud:
Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers. EURO J. Comput. Optim. 7(3): 265-297 (2019) - Jean-Pierre Dussault, Mathieu Frappier, Jean Charles Gilbert:
A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem. EURO J. Comput. Optim. 7(4): 359-380 (2019) - Falk M. Hante, Martin Schmidt:
Complementarity-based nonlinear programming techniques for optimal mixing in gas networks. EURO J. Comput. Optim. 7(3): 299-323 (2019) - Achim Hildenbrandt:
A branch-and-cut algorithm for the target visitation problem. EURO J. Comput. Optim. 7(3): 209-242 (2019) - Serdar Kadioglu:
Core group placement: allocation and provisioning of heterogeneous resources. EURO J. Comput. Optim. 7(3): 243-264 (2019) - Xiaolong Kuang, Bissan Ghaddar, Joe Naoum-Sawaya, Luis F. Zuluaga:
Alternative SDP and SOCP approximations for polynomial optimization. EURO J. Comput. Optim. 7(2): 153-175 (2019) - Renke Kuhlmann:
Learning to steer nonlinear interior-point methods. EURO J. Comput. Optim. 7(4): 381-419 (2019) - Philippe Lacomme, Aziz Moukrim, Alain Quilliot, Marina Vinot:
Integration of routing into a resource-constrained project scheduling problem. EURO J. Comput. Optim. 7(4): 421-464 (2019) - Cláudio P. Santiago, Sérgio Assunção Monteiro, Helder Inácio, Nelson Maculan, Maria Helena Jardim:
An efficient algorithm for the projection of a point on the intersection of two hyperplanes and a box in \(\mathbb {R}n\). EURO J. Comput. Optim. 7(2): 177-207 (2019) - Thiago Gouveia da Silva, Serigne Gueye, Philippe Michelon, Luiz Satoru Ochi, Lucídio dos Anjos Formiga Cabral:
A polyhedral approach to the generalized minimum labeling spanning tree problem. EURO J. Comput. Optim. 7(1): 47-77 (2019) - Janne Sorsa:
Real-time algorithms for the bilevel double-deck elevator dispatching problem. EURO J. Comput. Optim. 7(1): 79-122 (2019) - Vilmar Jefté Rodrigues de Sousa, Miguel F. Anjos, Sébastien Le Digabel:
Improving the linear relaxation of maximum k-cut with semidefinite-based constraints. EURO J. Comput. Optim. 7(2): 123-151 (2019)
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-06-26 23:36 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