![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 21 matches
- 2017
- Wim van Ackooij
:
A comparison of four approaches from stochastic programming for large-scale unit-commitment. EURO J. Comput. Optim. 5(1-2): 119-147 (2017) - Thais Ávila, Ángel Corberán
, Isaac Plana
, José M. Sanchis
:
Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem. EURO J. Comput. Optim. 5(3): 339-365 (2017) - René Brandenberg
, Matthias Huber, Matthias Silbernagl:
The summed start-up costs in a unit commitment problem. EURO J. Comput. Optim. 5(1-2): 203-238 (2017) - Claudia D'Ambrosio, Antonio Frangioni
, Andrea Lodi, Martin Mevissen:
Special issue on: Nonlinear and combinatorial methods for energy optimization. EURO J. Comput. Optim. 5(1-2): 1-3 (2017) - David Van Den Dooren, Thomas Sys, Túlio A. M. Toffolo
, Tony Wauters
, Greet Vanden Berghe:
Multi-machine energy-aware scheduling. EURO J. Comput. Optim. 5(1-2): 285-307 (2017) - Nicolas Dupin
:
Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints. EURO J. Comput. Optim. 5(1-2): 149-176 (2017) - Marcia Fampa
, Jon Lee
, Wendel Melo
:
On global optimization with indefinite quadratics. EURO J. Comput. Optim. 5(3): 309-337 (2017) - Claudio Gentile
, Germán Morales-España
, Andrés Ramos
:
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints. EURO J. Comput. Optim. 5(1-2): 177-201 (2017) - Pierre Hansen, Nenad Mladenovic
, Raca Todosijevic
, Saïd Hanafi:
Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3): 423-454 (2017) - Jesco Humpola, Felipe Serrano:
Sufficient pruning conditions for MINLP in gas network design. EURO J. Comput. Optim. 5(1-2): 239-261 (2017) - Rahma Lahyani, Mahdi Khemakhem, Frédéric Semet
:
A unified matheuristic for solving multi-constrained traveling salesman problems with profits. EURO J. Comput. Optim. 5(3): 393-422 (2017) - Jean B. Lasserre
, Kim-Chuan Toh, Shouguang Yang:
A bounded degree SOS hierarchy for polynomial optimization. EURO J. Comput. Optim. 5(1-2): 87-117 (2017) - Jon Lee
, Angelika Wiegele
:
Another pedagogy for mixed-integer Gomory. EURO J. Comput. Optim. 5(4): 455-466 (2017) - Mario Levorato
, Rosa Figueiredo, Yuri Frota, Lúcia M. A. Drummond
:
Evaluating balancing on social networks through the efficient solution of correlation clustering problems. EURO J. Comput. Optim. 5(4): 467-498 (2017) - Mario Levorato, Rosa Figueiredo, Yuri Frota, Lúcia M. A. Drummond
:
Erratum to: Evaluating balancing on social networks through the efficient solution of correlation clustering problems. EURO J. Comput. Optim. 5(4): 499 (2017) - Milagros Loreto
, Hugo Aponte, Debora Cores, Marcos Raydan
:
Nonsmooth spectral gradient methods for unconstrained optimization. EURO J. Comput. Optim. 5(4): 529-553 (2017) - Mehdi Madani, Mathieu Van Vyve:
A MIP framework for non-convex uniform price day-ahead electricity auctions. EURO J. Comput. Optim. 5(1-2): 263-284 (2017) - Jérôme Malick, Welington de Oliveira, Sofia Zaourar:
Uncontrolled inexact information within bundle methods. EURO J. Comput. Optim. 5(1-2): 5-29 (2017) - Luca Mencarelli
, Youcef Sahraoui, Leo Liberti:
A multiplicative weights update algorithm for MINLP. EURO J. Comput. Optim. 5(1-2): 31-86 (2017) - Julia Sender
, Thomas Siwczyk, Petra Mutzel
, Uwe Clausen:
Matheuristics for optimizing the network in German wagonload traffic. EURO J. Comput. Optim. 5(3): 367-392 (2017) - Adriano Verdério
, Elizabeth W. Karas, Lucas G. Pedroso
, Katya Scheinberg
:
On the construction of quadratic models for derivative-free trust-region algorithms. EURO J. Comput. Optim. 5(4): 501-527 (2017)
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-08-26 15:18 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