From: Jesper Hansen Ph.D.Student (jc 1/2002) <jha_at_imm.dtu.dk>

Date: Thu 02 Jan 2003 01:51:55 PM GMT

Message-ID: <3E1443FB.3090403@imm.dtu.dk>

Date: Thu 02 Jan 2003 01:51:55 PM GMT

Message-ID: <3E1443FB.3090403@imm.dtu.dk>

Hi eclipse users I stumbled over a Travelling Salesman Problem formulation that looked quite neat compared to the wellknown MIP formulation with an exponential no. of subtour elimination constraints. It looks something like this: \min \sum_{i=1,...,n} c_{y_i,y_{i+1}} alldifferent(y_1,...,y_n), y_{n+1} = y_1, y_i \in \{1,...,n\}, i=1,...,n+1 I was wondering how to formulate it in ECLiPSe. c is a matrix, which is indexed in the objective function by variables, but as far as I know this is not possible in ECLiPSe. Is there another way to do it or is this just another CLP showoff of simple formulations? ;-) 'Jesper -- _______________________________________ Jesper Hansen Ph.D. student Telephone: (+45) 45 25 33 88 Telefax.: (+45) 45 25 26 73 E-mail: mailto:jha@imm.dtu.dk Homepage: http://www.imm.dtu.dk/~jha/ Department of Mathematical Modelling Building 305 Technical University of Denmark DK-2800 LyngbyReceived on Thu Jan 02 13:59:07 2003

*
This archive was generated by hypermail 2.1.8
: Wed 16 Nov 2005 06:07:20 PM GMT GMT
*