COIN-OR::LEMON - Graph Library

Changeset 1034:ef200e268af2 in lemon-main for doc/groups.dox


Ignore:
Timestamp:
01/09/11 00:56:52 (10 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Unifications and improvements in TSP algorithms (#386)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r1032 r1034  
    562562once (i.e. the minimum cost Hamiltonian cycle).
    563563
    564 These TSP algorithms should be used with a
    565 metric cost function. Otherwise, they could yield worse results.
     564These TSP algorithms are intended to be used with a \e metric \e cost
     565\e function, i.e. the edge costs should satisfy the triangle inequality.
     566Otherwise the algorithms could yield worse results.
    566567
    567568LEMON provides five well-known heuristics for solving symmetric TSP:
Note: See TracChangeset for help on using the changeset viewer.