Остановите войну!
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 16 matches
- 2018
- Christian Artigues, Nicolas Jozefowiez, Boadu Mensah Sarpong:
Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective. EURO J. Comput. Optim. 6(2): 117-142 (2018) - Walid Ben-Ameur, Adam Ouorou, Guanglei Wang, Mateusz Zotkiewicz:
Multipolar robust optimization. EURO J. Comput. Optim. 6(4): 395-434 (2018) - Christoph Buchheim, Jannis Kurtz:
Robust combinatorial optimization under convex and discrete cost uncertainty. EURO J. Comput. Optim. 6(3): 211-238 (2018) - Christina Büsing, Sigrid Knust, Xuan Thanh Le:
Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation. EURO J. Comput. Optim. 6(4): 339-365 (2018) - Mervat Chouman, Teodor Gabriel Crainic, Bernard Gendron:
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design. EURO J. Comput. Optim. 6(2): 143-184 (2018) - Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger:
Robust balanced optimization. EURO J. Comput. Optim. 6(3): 239-266 (2018) - Virginie Gabrel, Cécile Murat, Aurélie Thiele:
Portfolio optimization with pw-robustness. EURO J. Comput. Optim. 6(3): 267-290 (2018) - Sune Lauth Gadegaard, Andreas Klose, Lars Relund Nielsen:
An improved cut-and-solve algorithm for the single-source capacitated facility location problem. EURO J. Comput. Optim. 6(1): 1-27 (2018) - Anjulika Gupta, Prabha Sharma, Hemant Salwan:
A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights. EURO J. Comput. Optim. 6(1): 29-54 (2018) - Idir Hamaz, Laurent Houssin, Sonia Cafieri:
A robust basic cyclic scheduling problem. EURO J. Comput. Optim. 6(3): 291-313 (2018) - Kamyar Kargar, Halil Ibrahim Bayrak, Mustafa Ç. Pinar:
Robust bilateral trade with discrete types. EURO J. Comput. Optim. 6(4): 367-393 (2018) - Arie M. C. A. Koster, Michael Poss:
Special issue on: robust combinatorial optimization. EURO J. Comput. Optim. 6(3): 207-209 (2018) - Jannis Kurtz:
Robust combinatorial optimization under budgeted-ellipsoidal uncertainty. EURO J. Comput. Optim. 6(4): 315-337 (2018) - Gizem Ozbaygin, Oya Ekin Karasan, Hande Yaman:
New exact solution approaches for the split delivery vehicle routing problem. EURO J. Comput. Optim. 6(1): 85-115 (2018) - Dimitri J. Papageorgiou, Francisco Trespalacios:
Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming. EURO J. Comput. Optim. 6(1): 55-83 (2018) - Abdelouahab Zaghrouti, Issmail El Hallaoui, François Soumis:
Improved integral simplex using decomposition for the set partitioning problem. EURO J. Comput. Optim. 6(2): 185-206 (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-03 03:29 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