[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Help-glpk] [Fwd: help]
|
From: |
Michael Hennebry |
|
Subject: |
Re: [Help-glpk] [Fwd: help] |
|
Date: |
Sun, 27 Nov 2011 14:19:22 -0600 (CST) |
|
User-agent: |
Alpine 1.00 (DEB 882 2007-12-20) |
On Sun, 27 Nov 2011, Andrew Makhorin wrote:
-------- Forwarded Message --------
From: jjqcat jjqcat <address@hidden>
To: address@hidden
Subject: help
Date: Sat, 26 Nov 2011 23:07:23 +0800
Hi, I'm interested in GLPK and want to use it to solve my problem that is
fitness: a set of integer order
70.8 1 2 3 4 5 6 7 8
80.8 2 1 3 4 5 6 7 8
...
value n1 n2 n3 n4 n5 n6 n7 n8
this problem is similar to TSP(traveling salesman problem), but I
dont't know how to find one combination to get best fitness value.
From the rather small amount of information available,
I expect that the problem is an assignment problem.
If so, every basic solution is all-integer.
--
Michael address@hidden
"On Monday, I'm gonna have to tell my kindergarten class,
whom I teach not to run with scissors,
that my fiance ran me through with a broadsword." -- Lily