Остановите войну!
for scientists:
default search action
Thomas Stützle
- > Home > Persons > Thomas Stützle
Publications
- 2018
- [p13]Luís Paquete, Thomas Stützle:
Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization: A Review. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 411-425 - 2010
- [c52]Manuel López-Ibáñez, Thomas Stützle, Luís Paquete:
Graphical tools for the analysis of bi-objective optimization algorithms: [workshop on theoretical aspects of evolutionary multiobjective optimization]. GECCO (Companion) 2010: 1959-1962 - [p9]Manuel López-Ibáñez, Luís Paquete, Thomas Stützle:
Exploratory Analysis of Stochastic Local Search Algorithms in Biobjective Optimization. Experimental Methods for the Analysis of Optimization Algorithms 2010: 209-222 - [p6]Luís Paquete, Thomas Stützle:
On the Performance of Local Search for the Biobjective Traveling Salesman Problem. Advances in Multi-Objective Nature Inspired Computing 2010: 143-165 - 2009
- [j30]Luís Paquete, Thomas Stützle:
Design and analysis of stochastic local search for the multiobjective traveling salesman problem. Comput. Oper. Res. 36(9): 2619-2631 (2009) - 2007
- [j18]Luís Paquete, Tommaso Schiavinotto, Thomas Stützle:
On local optima in multiobjective combinatorial optimization problems. Ann. Oper. Res. 156(1): 83-97 (2007) - [p3]Luís Paquete, Thomas Stützle, Manuel López-Ibáñez:
Using Experimental Design to Analyze Stochastic Local Search Algorithms for Multiobjective Problems. Metaheuristics 2007: 325-344 - [r2]Luís Paquete, Thomas Stützle:
Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j12]Luís Paquete, Thomas Stützle:
A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices. Eur. J. Oper. Res. 169(3): 943-959 (2006) - [j10]Manuel López-Ibáñez, Luís Paquete, Thomas Stützle:
Hybrid Population-Based Algorithms for the Bi-Objective Quadratic Assignment Problem. J. Math. Model. Algorithms 5(1): 111-137 (2006) - 2004
- [c22]Manuel López-Ibáñez, Luís Paquete, Thomas Stützle:
On the Design of ACO for the Biobjective Quadratic Assignment Problem. ANTS Workshop 2004: 214-225 - [p2]Luís Paquete, Marco Chiarandini, Thomas Stützle:
Pareto Local Optimum Sets in the Biobjective Traveling Salesman Problem: An Experimental Study. Metaheuristics for Multiobjective Optimisation 2004: 177-199 - 2003
- [c17]Luís Paquete, Thomas Stützle:
A Two-Phase Local Search for the Biobjective Traveling Salesman Problem. EMO 2003: 479-493 - 2002
- [c13]Luís Paquete, Thomas Stützle:
An Experimental Investigation of Iterated Local Search for Coloring Graphs. EvoWorkshops 2002: 122-131 - [c12]Mauro Birattari, Thomas Stützle, Luís Paquete, Klaus Varrentrapp:
A Racing Algorithm for Configuring Metaheuristics. GECCO 2002: 11-18 - [c11]Olivia Rossi-Doria, Michael Sampels, Mauro Birattari, Marco Chiarandini, Marco Dorigo, Luca Maria Gambardella, Joshua D. Knowles, Max Manfrin, Monaldo Mastrolilli, Ben Paechter, Luís Paquete, Thomas Stützle:
A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem. PATAT 2002: 329-354
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.
last updated on 2024-04-21 17:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint