Back to Results
First PageMeta Content
Applied mathematics / Heuristics / Combinatorial optimization / NP-complete problems / Travelling salesman problem / Heuristic function / Heuristic / A* search algorithm / Branch and bound / Mathematics / Theoretical computer science / Operations research


Computers & Operations Research[removed] – 504 www.elsevier.com/locate/dsw
Add to Reading List

Document Date: 2003-02-03 07:58:48


Open Document

File Size: 120,22 KB

Share Result on Facebook

City

Laval / /

Company

Elsevier Science Ltd. / Delphi / /

Country

Canada / /

/

/

IndustryTerm

lexicographic algorithm / erent products / minimum insertion travel cost / given product / travel cost cij / search heuristic / search process escape / on tabu search / travel costs / feasible solution / near-optimal solutions / partial solution / travel cost / markets selling product / branch-and-cut algorithm / ÿrst product / travel cost saving / ÿrst feasible solution / tabu search / given products / search tree / lexicographic search heuristic / branch-and-bound algorithm / genetic search / added travel cost / earliest algorithms / /

OperatingSystem

Linux / Windows 95 / /

Organization

Ecole des Hautes Etudes Commerciales / /

Person

Singh Oudheusden / Van Oudheusden / Jacques Renauda / Fayez F. Boctora / Maxi / Gilbert Laportec / /

/

Position

salesman / Corresponding author / /

Product

Sony Ericsson P1i Smartphone / /

ProgrammingLanguage

Borland Delphi / TSP / C++ / /

Technology

good TSP algorithm / lexicographic algorithm / known algorithms / Linux / PKI / branch-and-cut algorithm / branch-and-bound algorithm / earliest algorithms / /

URL

http /

SocialTag