[eclipse-clp-users] Benchmark problems

Mail actions: [ respond to this message ] [ mail a new topic ]
Contemporary messages sorted: [ by date ] [ by thread ] [ by subject ] [ by author ] [ by messages with attachments ]

From: Hendrik Skubch <skubch_at_...196...>
Date: Sun, 01 May 2011 18:57:45 +0200

Hello all,

I'm writing an optimisation routine for continuous valued problems using 
lib ic. I am targeting small problems to be solved in real time. Though 
I am wondering if there are any benchmark problems available, so I could 
compare this algorithm to e.g., branch and bound.
Any pointers would be most welcome.

cheers,
	Hendrik Skubch.

Received on Sun May 01 2011 - 17:26:14 CEST

This message: [ Message body ]
Next message: Marco Gavanelli: "Re: [eclipse-clp-users] Problem with TSP(travelling salesman Problem) code when testing on real data"
Previous message: Nada Ossama: "[eclipse-clp-users] Problem with TSP(travelling salesman Problem) code when testing on real data"

Mail actions: [ respond to this message ] [ mail a new topic ]
Contemporary messages sorted: [ by date ] [ by thread ] [ by subject ] [ by author ] [ by messages with attachments ]

This archive was generated by hypermail 2.3.0 : Wed Sep 25 2024 - 15:13:20 CEST