Back to Results
First PageMeta Content
Operations research / NP-complete problems / Nearest neighbour algorithm / Integer sequences / Greedy algorithm / Domination analysis / Factorial / Heuristic function / Summation / Mathematics / Approximation algorithms / Travelling salesman problem


BRICS Basic Research in Computer Science BRICS RS-01-6 Gutin et al.: Domination Analysis of Greedy-Type Heuristics for the TSP
Add to Reading List

Document Date: 2001-02-27 07:23:57

Open Document

File Size: 83,64 KB

Share Result on Facebook

City

Berlin / Aarhus / Washington DC / Wiley / Surrey / /

Company

Hybrid Systems / /

Country

Denmark / /

Currency

Rs / /

/

Facility

Computer Science University of Aarhus / Computer Science University of Aarhus Ny Munkegade / Computer Science Aarhus University / University of London Egham / /

IndustryTerm

greedy algorithm / approximate solution / nearest neighbor algorithm / approximation algorithms / /

Organization

TSP Gregory Gutin Department of Computer Science Royal Holloway / BRICS Department / University of Aarhus / UK G.Gutin@rhul.ac.uk Anders Yeo BRICS Department / Computer Science Aarhus University / University of London Egham / Computer Science University of Aarhus Ny Munkegade / Department of Computer Science Royal Holloway / /

Person

Jakob Pagter / Kim G. Larsen / A.P. Punnen / Christian N. S. Pedersen / Paul Pettersson / Louis Salvail / Peter D. Mosses / Frits W. Vaandrager / Judi Romijn / Anna Ostlin / Claude Cr´epeau / F. Glover / Alexey Zverovich / S. Kabadi / Anders Yeo / Ansgar Fehnker / A. Punnen / Gregory Gutin / Thomas S. Hune / /

/

Position

Traveling salesman / TSP Traveling Salesman / salesman / Asymmetric Traveling Salesman / /

ProgrammingLanguage

DC / C / TSP / /

ProvinceOrState

New York / /

Technology

greedy algorithm / nearest neighbor algorithm / approximation algorithms / Polynomial approximation algorithms / Karp-Steele patching algorithm / /

URL

ftp /

SocialTag