The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thomas Stützle: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sven Becker, Jens Gottlieb, Thomas Stützle
    Applications of Racing Algorithms: An Industrial Perspective. [Citation Graph (0, 0)][DBLP]
    Artificial Evolution, 2005, pp:271-283 [Conf]
  2. Michael Pavlin, Holger H. Hoos, Thomas Stützle
    Stochastic Local Search for Multiprocessor Scheduling for Minimum Total Tardiness. [Citation Graph (0, 0)][DBLP]
    Canadian Conference on AI, 2003, pp:96-113 [Conf]
  3. Kevin Smyth, Holger H. Hoos, Thomas Stützle
    Iterated Robust Tabu Search for MAX-SAT. [Citation Graph (0, 0)][DBLP]
    Canadian Conference on AI, 2003, pp:129-144 [Conf]
  4. Max Manfrin, Mauro Birattari, Thomas Stützle, Marco Dorigo
    Parallel Ant Colony Optimization for the Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    ANTS Workshop, 2006, pp:224-234 [Conf]
  5. Prasanna Balaprakash, Mauro Birattari, Thomas Stützle, Marco Dorigo
    Incremental Local Search in Ant Colony Optimization: Why It Fails for the Quadratic Assignment Problem. [Citation Graph (0, 0)][DBLP]
    ANTS Workshop, 2006, pp:156-166 [Conf]
  6. Jodelson A. Sabino, Thomas Stützle, Mauro Birattari, José Eugênio Leal
    ACO Applied to Switch Engine Scheduling in a Railroad Yard. [Citation Graph (0, 0)][DBLP]
    ANTS Workshop, 2006, pp:502-503 [Conf]
  7. Jens Gimmler, Thomas Stützle, Thomas E. Exner
    Hybrid Particle Swarm Optimization: An Examination of the Influence of Iterative Improvement Algorithms on Performance. [Citation Graph (0, 0)][DBLP]
    ANTS Workshop, 2006, pp:436-443 [Conf]
  8. Wolfram Wiesemann, Thomas Stützle
    Iterated Ants: An Experimental Study for the Quadratic Assignment Problem. [Citation Graph (0, 0)][DBLP]
    ANTS Workshop, 2006, pp:179-190 [Conf]
  9. Oliver Korb, Thomas Stützle, Thomas E. Exner
    PLANTS: Application of Ant Colony Optimization to Structure-Based Drug Design. [Citation Graph (0, 0)][DBLP]
    ANTS Workshop, 2006, pp:247-258 [Conf]
  10. Lucas Lessing, Irina Dumitrescu, Thomas Stützle
    A Comparison Between ACO Algorithms for the Set Covering Problem. [Citation Graph (0, 0)][DBLP]
    ANTS Workshop, 2004, pp:1-12 [Conf]
  11. Manuel López-Ibáñez, Luis Paquete, Thomas Stützle
    On the Design of ACO for the Biobjective Quadratic Assignment Problem. [Citation Graph (0, 0)][DBLP]
    ANTS Workshop, 2004, pp:214-225 [Conf]
  12. Marco Antonio Montes de Oca, Thomas Stützle, Mauro Birattari, Marco Dorigo
    A Comparison of Particle Swarm Optimization Algorithms Based on Run-Length Distributions. [Citation Graph (0, 0)][DBLP]
    ANTS Workshop, 2006, pp:1-12 [Conf]
  13. Holger H. Hoos, Thomas Stützle
    Some Surprising Regularities in the Behaviour of Stochastic Local Search. [Citation Graph (0, 0)][DBLP]
    CP, 1998, pp:470- [Conf]
  14. Luis Paquete, Thomas Stützle
    A Two-Phase Local Search for the Biobjective Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    EMO, 2003, pp:479-493 [Conf]
  15. Matthijs den Besten, Thomas Stützle, Marco Dorigo
    Design of Iterated Local Search Algorithms. [Citation Graph (0, 0)][DBLP]
    EvoWorkshops, 2001, pp:441-451 [Conf]
  16. Irina Dumitrescu, Thomas Stützle
    Combinations of Local Search and Exact Algorithms. [Citation Graph (0, 0)][DBLP]
    EvoWorkshops, 2003, pp:211-223 [Conf]
  17. Markus Finger, Thomas Stützle, Helena Lourenço
    Exploiting Fitness Distance Correlation of Set Covering Problems. [Citation Graph (0, 0)][DBLP]
    EvoWorkshops, 2002, pp:61-71 [Conf]
  18. Luis Paquete, Thomas Stützle
    An Experimental Investigation of Iterated Local Search for Coloring Graphs. [Citation Graph (0, 0)][DBLP]
    EvoWorkshops, 2002, pp:122-131 [Conf]
  19. Tommaso Schiavinotto, Thomas Stützle
    Search Space Analysis of the Linear Ordering Problem. [Citation Graph (0, 0)][DBLP]
    EvoWorkshops, 2003, pp:322-333 [Conf]
  20. Thomas Stützle, Susana Fernandes
    New Benchmark Instances for the QAP and the Experimental Analysis of Algorithms. [Citation Graph (0, 0)][DBLP]
    EvoCOP, 2004, pp:199-209 [Conf]
  21. Mauro Birattari, Thomas Stützle, Luis Paquete, Klaus Varrentrapp
    A Racing Algorithm for Configuring Metaheuristics. [Citation Graph (0, 0)][DBLP]
    GECCO, 2002, pp:11-18 [Conf]
  22. Marco Chiarandini, Thomas Stützle, Kim S. Larsen
    Colour Reassignment in Tabu Search for the Graph Set T-Colouring Problem. [Citation Graph (0, 0)][DBLP]
    Hybrid Metaheuristics, 2006, pp:162-177 [Conf]
  23. Frank Hutter, Holger H. Hoos, Thomas Stützle
    Efficient Stochastic Local Search for MPE Solving. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:169-174 [Conf]
  24. Thomas Stützle
    A Neural Network Approach to Quality Control Charts. [Citation Graph (0, 0)][DBLP]
    IWANN, 1995, pp:1135-1141 [Conf]
  25. Holger H. Hoos, Thomas Stützle
    Systematic vs. Local Search for SAT. [Citation Graph (0, 0)][DBLP]
    KI, 1999, pp:289-293 [Conf]
  26. Olaf Steinmann, Antje Strohmaier, Thomas Stützle
    Tabu Search vs. Random Walk. [Citation Graph (0, 0)][DBLP]
    KI, 1997, pp:337-348 [Conf]
  27. Olivia Rossi-Doria, Michael Sampels, Mauro Birattari, Marco Chiarandini, Marco Dorigo, Luca Maria Gambardella, Joshua D. Knowles, Max Manfrin, Monaldo Mastrolilli, Ben Paechter, Luis Paquete, Thomas Stützle
    A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem. [Citation Graph (0, 0)][DBLP]
    PATAT, 2002, pp:329-354 [Conf]
  28. Matthijs den Besten, Thomas Stützle, Marco Dorigo
    Ant Colony Optimization for the Total Weighted Tardiness Problem. [Citation Graph (0, 0)][DBLP]
    PPSN, 2000, pp:611-620 [Conf]
  29. Holger H. Hoos, Kevin Smyth, Thomas Stützle
    Search Space Features Underlying the Performance of Stochastic Local Search Algorithms for MAX-SAT. [Citation Graph (0, 0)][DBLP]
    PPSN, 2004, pp:51-60 [Conf]
  30. Thomas Stützle, Andreas Grün, Sebastian Linke, Marco Rüttger
    A Comparison of Nature Inspired Heuristics on the Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    PPSN, 2000, pp:661-670 [Conf]
  31. Thomas Stützle
    Parallelization Strategies for Ant Colony Optimization. [Citation Graph (0, 0)][DBLP]
    PPSN, 1998, pp:722-731 [Conf]
  32. Holger H. Hoos, Thomas Stützle
    Evaluating Las Vegas Algorithms: Pitfalls and Remedies. [Citation Graph (0, 0)][DBLP]
    UAI, 1998, pp:238-245 [Conf]
  33. Holger H. Hoos, Thomas Stützle
    Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1999, v:112, n:1-2, pp:213-232 [Journal]
  34. Holger H. Hoos, Thomas Stützle
    Local Search Algorithms for SAT: An Empirical Evaluation. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2000, v:24, n:4, pp:421-481 [Journal]
  35. Thomas Stützle
    Lokale Suchverfahren für Constrain Satisfaction Probleme: die min conflicts Heuristik und Tabu Search. [Citation Graph (0, 0)][DBLP]
    KI, 1997, v:11, n:1, pp:14-20 [Journal]
  36. Thomas Stützle, Holger H. Hoos
    Ameisenalgorithmen zur Lösung kombinatorischer Optimierungsprobleme. [Citation Graph (0, 0)][DBLP]
    KI, 2001, v:15, n:1, pp:45-51 [Journal]
  37. Luca Maria Gambardella, Marco Dorigo, Martin Middendorf, Thomas Stützle
    Guest editorial: special section on ant colony optimization. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Evolutionary Computation, 2002, v:6, n:4, pp:317-319 [Journal]
  38. Thomas Stützle, Marco Dorigo
    A short convergence proof for a class of ant colony optimization algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Evolutionary Computation, 2002, v:6, n:4, pp:358-365 [Journal]
  39. Thomas Stützle
    Iterated local search for the quadratic assignment problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:174, n:3, pp:1519-1539 [Journal]
  40. Rubén Ruiz, Thomas Stützle
    A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:177, n:3, pp:2033-2049 [Journal]
  41. Luis Paquete, Thomas Stützle
    A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:169, n:3, pp:943-959 [Journal]
  42. Frank Hutter, Holger H. Hoos, Thomas Stützle
    Automatic Algorithm Configuration Based on Local Search. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:1152-1157 [Conf]
  43. Prasanna Balaprakash, Mauro Birattari, Thomas Stützle
    Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement. [Citation Graph (0, 0)][DBLP]
    Hybrid Metaheuristics, 2007, pp:108-122 [Conf]
  44. Marco Chiarandini, Thomas Stützle
    Stochastic Local Search Algorithms for Graph Set T -colouring and Frequency Assignment. [Citation Graph (0, 0)][DBLP]
    Constraints, 2007, v:12, n:3, pp:371-403 [Journal]
  45. Thomas Stützle, Holger H. Hoos
    MAX-MIN Ant System. [Citation Graph (0, 0)][DBLP]
    Future Generation Comp. Syst., 2000, v:16, n:8, pp:889-914 [Journal]
  46. Marco Dorigo, Gianni Di Caro, Thomas Stützle
    Ant algorithms. [Citation Graph (0, 0)][DBLP]
    Future Generation Comp. Syst., 2000, v:16, n:8, pp:- [Journal]

  47. An Analysis of Algorithmic Components for Multiobjective Ant Colony Optimization: A Case Study on the Biobjective TSP. [Citation Graph (, )][DBLP]


  48. On the Difficulty of Inferring Gene Regulatory Networks: A Study of the Fitness Landscape Generated by Relative Squared Error. [Citation Graph (, )][DBLP]


  49. Ant Colony Optimization. [Citation Graph (, )][DBLP]


  50. Reactive Stochastic Local Search Algorithms for the Genomic Median Problem. [Citation Graph (, )][DBLP]


  51. Convergence behavior of the fully informed particle swarm optimization algorithm. [Citation Graph (, )][DBLP]


  52. Towards incremental social learning in optimization and multiagent systems. [Citation Graph (, )][DBLP]


  53. The impact of design choices of multiobjective antcolony optimization algorithms on performance: an experimental study on the biobjective TSP. [Citation Graph (, )][DBLP]


  54. Graphical tools for the analysis of bi-objective optimization algorithms: [workshop on theoretical aspects of evolutionary multiobjective optimization]. [Citation Graph (, )][DBLP]


  55. Effective Hybrid Stochastic Local Search Algorithms for Biobjective Permutation Flowshop Scheduling. [Citation Graph (, )][DBLP]


  56. Incremental Particle Swarm-Guided Local Search for Continuous Optimization. [Citation Graph (, )][DBLP]


  57. Iterated Greedy Algorithms for a Real-World Cyclic Train Scheduling Problem. [Citation Graph (, )][DBLP]


  58. Hierarchical Iterated Local Search for the Quadratic Assignment Problem. [Citation Graph (, )][DBLP]


  59. An Analysis of Heuristics for Vertex Colouring. [Citation Graph (, )][DBLP]


  60. Heterogeneous particle swarm optimizers. [Citation Graph (, )][DBLP]


  61. Adaptive "Anytime" Two-Phase Local Search. [Citation Graph (, )][DBLP]


  62. A review of metrics on permutations for search landscape analysis. [Citation Graph (, )][DBLP]


  63. Design and analysis of stochastic local search for the multiobjective traveling salesman problem. [Citation Graph (, )][DBLP]


  64. Estimation-based metaheuristics for the probabilistic traveling salesman problem. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002