Salesman

Results: 438



#Item
51Cybernetics / Global Positioning System / Navigation / Orienteering / Waypoint / Evolutionary algorithms / Control theory / CMA-ES / Mathematical optimization / Controller / Video game bot / Monte Carlo tree search

Monte Carlo Tree Search with Macro-Actions and Heuristic Route Planning for the Multiobjective Physical Travelling Salesman Problem Edward J. Powley, Daniel Whitehouse, and Peter I. Cowling Department of Computer Science

Add to Reading List

Source URL: eldar.mathstat.uoguelph.ca

Language: English - Date: 2016-07-12 12:05:04
52Constraint programming / Operations research / Search algorithms / Constraint satisfaction problem / Mathematical optimization / Constraint satisfaction / Heuristic / Algorithm / Duality / Backtracking / Travelling salesman problem / Local consistency

Solving Dynamic Constraint Satisfaction Problems: Relations between Problem Alteration and Search Performance Richard J. Wallace, Diarmuid Grimes and Eugene C. Freuder Cork Constraint Computation Centre and Department of

Add to Reading List

Source URL: tmancini.di.uniroma1.it

Language: English - Date: 2008-12-16 11:07:53
53Coding theory / Computer arithmetic / Error detection and correction / Dating methodologies in archaeology / Predynastic Egypt / Flinders Petrie / Seriation / Naqada culture / Typology / Travelling salesman problem / Archaeology / Hamming code

199 Documenta Math. Flinders Petrie, the Travelling Salesman Problem, and the Beginning of Mathematical Modeling

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2012-07-29 04:14:08
54Operations research / Combinatorial optimization / Travelling salesman problem / Branch and bound / Linear programming relaxation / Integer programming / Branch and cut / Linear programming / Algorithm / Mathematical optimization / Cutting-plane method / Simplex algorithm

227 Documenta Math. Markowitz and Manne + Eastman + Land and Doig = Branch and Bound

Add to Reading List

Source URL: documenta.sagemath.org

Language: English - Date: 2012-07-25 10:25:04
55NP-hard problems / NP-complete problems / Operations research / Travelling salesman problem / Gadget / Graph

Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP∗ Matthias Englert Heiko R¨oglin

Add to Reading List

Source URL: www.dcs.warwick.ac.uk

Language: English - Date: 2008-09-04 11:36:22
56Operations research / Mathematical optimization / Search algorithms / NP-complete problems / Combinatorial optimization / Variable neighborhood search / Vehicle routing problem / Travelling salesman problem / Heuristic / A* search algorithm / Lagrangian relaxation / Local search

Combining Constraint Programming, Lagrangian Relaxation and Probabilistic Algorithms to solve the Vehicle Routing Problem Daniel Guimarans1 , Rosa Herrero1 , Daniel Riera2 , Angel A. Juan2 , and Juan Jos´e Ramos1 1

Add to Reading List

Source URL: ceur-ws.org

Language: English - Date: 2010-05-18 03:15:30
57Constraint programming / Operations research / Search algorithms / Constraint satisfaction problem / Mathematical optimization / Constraint satisfaction / Heuristic / Algorithm / Duality / Backtracking / Travelling salesman problem / Local consistency

Solving Dynamic Constraint Satisfaction Problems: Relations between Problem Alteration and Search Performance Richard J. Wallace, Diarmuid Grimes and Eugene C. Freuder Cork Constraint Computation Centre and Department of

Add to Reading List

Source URL: ceur-ws.org

Language: English - Date: 2008-12-04 06:10:17
58Phylogenetics / Computational phylogenetics / Analysis of algorithms / Theoretical computer science / Bioinformatics / Genetic algorithm / Algorithm engineering / Algorithm / Empirical algorithmics / Cache-oblivious algorithm / Phylogenetic tree / Travelling salesman problem

High-Performance Algorithm Engineering for Computational Phylogenetics Bernard M.E. Moret1 , David A. Bader2 , and Tandy Warnow3 1 2

Add to Reading List

Source URL: www.cs.unm.edu

Language: English - Date: 2002-10-09 00:06:39
59Operations research / Travelling salesman problem

TSPLIB 95 Gerhard Reinelt Universit¨ at Heidelberg Institut f¨ ur Angewandte Mathematik

Add to Reading List

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

Language: English - Date: 2016-04-28 10:35:50
60Computational complexity theory / Approximation algorithms / Complexity classes / Operations research / NP-complete problems / Polynomial-time approximation scheme / Travelling salesman problem / Steiner tree problem / APX / Optimization problem / Combinatorial optimization / NP

Theoretical Computer Science–2863 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs

Add to Reading List

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

Language: English - Date: 2014-11-26 08:32:25
UPDATE