1 Automated Map Generation for the Physical Travelling Salesman Problem Diego Perez, Student Member IEEE, Julian Togelius, Member IEEE, Spyridon Samothrakis, Student Member IEEE, Philipp Rohlfshagen, Member IEEE,

Source URL: www.diego-perez.net

The Physical Travelling Salesman Problem: WCCI 2012 Competition Diego Perez Philipp Rohlfshagen

Source URL: www.diego-perez.net

Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals∗ Markus Bl¨aser1 Bodo Manthey2

Source URL: www-cc.cs.uni-saarland.de

• Mathematical analysis
• Mathematics
• Analysis
• Generalized functions
• Smooth functions
• Operations research
• Travelling salesman problem
• Distribution
• Limit of a function
• Approximation algorithm
• Convex function
• Euclidean algorithm

TECHNISCHE UNIVERSITÄT WIEN Institut für Computergraphik und Algorithmen Load-Dependent and Precedence-Based Models for Pickup and Delivery Problems

Source URL: www.ads.tuwien.ac.at

• Graph theory
• Operations research
• Mathematics
• Computational complexity theory
• Network flow
• NP-complete problems
• NP-hard problems
• Travelling salesman problem
• Multi-commodity flow problem
• Flow network

Thursday 31 March EvoCOP 1 - Real World Applications, 11:30-13:10 Chaired by Francisco Chicano Particle Swarm Optimization for Multi-Objective Web Service Location Allocation,

Source URL: www.evostar.org

• Mathematics
• Operations research
• Computational complexity theory
• Applied mathematics
• Mathematical optimization
• NP-complete problems
• Cybernetics
• Heuristics
• Hyper-heuristic
• Genetic algorithm
• Travelling salesman problem
• Evolutionary algorithm

Approximation bounds for Black Hole Search problems? Ralf Klasing?? , Euripides Markou? ? ? , Tomasz Radzik† , Fabiano Sarracco‡ Abstract. A black hole is a highly harmful stationary process residing in a node of a n

Source URL: emarkou.users.uth.gr

• Graph theory
• Mathematics
• Computational complexity theory
• Operations research
• Combinatorial optimization
• Routing algorithms
• Search algorithms
• Edsger W. Dijkstra
• Travelling salesman problem
• A* search algorithm
• Flow network
• Tree traversal

Microsoft Word - orbs7180.doc

Source URL: www.math.hkbu.edu.hk

• Operations research
• Mathematics
• Computational complexity theory
• Applied mathematics
• Mathematical optimization
• Heuristic
• Integer programming
• Relaxation
• Branch and bound
• Combinatorial optimization
• Travelling salesman problem
• Algorithm

comput. complex), 281 – 040281–27 DOIs00037c Birkh¨

Source URL: www.cs.huji.ac.il

• Computational complexity theory
• Graph theory
• NP-complete problems
• Mathematics
• Travelling salesman problem
• Set TSP problem
• Steiner tree problem
• Vertex cover
• Approximation algorithm
• APX
• Cut
• Time complexity

Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems∗ Karl Bringmann†1 , Christian Engels2 , Bodo Manthey3 , and B. V. Raghavendra Rao4 1

Source URL: people.mpi-inf.mpg.de

• Graph theory
• Mathematics
• Computational complexity theory
• NP-hard problems
• NP-complete problems
• Edsger W. Dijkstra
• Combinatorial optimization
• Approximation algorithms
• Travelling salesman problem
• Shortest path problem
• Matching
• Randomized algorithm

TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel

Source URL: www.iwr.uni-heidelberg.de

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Graph
• Travelling salesman problem
• Vertex
• Cycle
• Hamiltonian path
• Graph automorphism
• Vertex cover