-------- Forwarded Message -------- From: jjqcat jjqcat <[email protected]> To: [email protected] 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. Thanks very much _______________________________________________ Help-glpk mailing list [email protected] https://lists.gnu.org/mailman/listinfo/help-glpk
