<--- Back to Details
First PageDocument Content
Travelling salesman problem / NP-complete problems / Approximation algorithms / Operations research / Graph / Nearest neighbour algorithm / Concorde TSP Solver / Hamiltonian path / Optimization problem / Theoretical computer science / Mathematics / Graph theory
Date: 2005-01-12 05:25:58
Travelling salesman problem
NP-complete problems
Approximation algorithms
Operations research
Graph
Nearest neighbour algorithm
Concorde TSP Solver
Hamiltonian path
Optimization problem
Theoretical computer science
Mathematics
Graph theory

Add to Reading List

Source URL: www.cs.rhul.ac.uk

Download Document from Source Website

File Size: 196,04 KB

Share Document on Facebook

Similar Documents

Graph theory / Mathematics / Discrete mathematics / Vertex cover / Network theory / Degree / Networks / Graph operations / Capacitated minimum spanning tree / Centrality

The Complexity of Safety Stock Placement in General-Network Supply Chains Ekaterina Lesnaia, Iuliu Vasilescu, and Stephen C. Graves MIT Abstract— We consider the optimization problem of safety

DocID: 1xThh - View Document

Computing / Information theory / Information and communications technology / Telecommunications engineering / Data transmission / Network performance / Computer networking / Internet architecture / Multipath routing / Transmission Control Protocol / Packet loss / Routing

Deadline-Aware Multipath Communication: An Optimization Problem Laurent Chuat∗ , Adrian Perrig∗ , Yih-Chun Hu† of Computer Science, ETH Zurich, Switzerland † Department of Electrical and Computer Engineering, Uni

DocID: 1xTc0 - View Document

Combined Optimization and Reinforcement Learning for Manipulation Skills Peter Englert and Marc Toussaint Machine Learning & Robotics Lab University of Stuttgart, Germany Abstract—This work addresses the problem of how

DocID: 1vjBp - View Document

The Quadratic Assignment Problem in Code Optimization for a Simple Universal Turing Machine

DocID: 1uZDW - View Document

Formulating an Optimization Problem

DocID: 1uSM0 - View Document