[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [Bug-glpk] Re: [Help-glpk] Problems with TSPSOL

From: Andrew Makhorin
Subject: Re: [Bug-glpk] Re: [Help-glpk] Problems with TSPSOL
Date: Sat, 10 Mar 2007 11:24:58 +0300

> tspsol prints the correct objective function in the .out-file, but the
> solution provided seems to be the earlier obtained solution.
> lpx_print_sol: writing LP problem solution to `example1_0_1.out'...
> +   262:   ip_obj =   4.630000000e+08 >=     tree is empty (0; 7)
> When I check this solution it has a cost of 465.

Oscar, looks like you sum up edge lengths marked by '*' while you
should use edges whose activity is 1, i.e. those ones which are included
in the tour. Edges marked by '*' correspond to the initial tour, not to
the optimal tour.

For example, edge '9-28' is *not* included in the optimal tour (its
activity is 0), however, it is presented in your .out file:

27 8 13000000

reply via email to

[Prev in Thread] Current Thread [Next in Thread]