Hi there, currently I am trying to convince minimize/6 not only to produce the best solution that can be found within a certain time, but to produce and store the five/ten/$n$ best solutions, such that they can be accessed after the termination of minimize/6. I found a reference to event 280 and the according cost_handler/2. Has anyone an idea how to "patch" this predicate to achieve the desired behavior? Many thanks and regards, Markus -- +--------------------------------------------------------------------+ | Markus Hannebauer www.first.gmd.de/~hannebau | | Dipl.-Inform., Research Fellow hannebau@first.gmd.de | | | | Research Institute for Computer Architecture | | and Software Technology (FIRST) | | phone: +49- 30-63 92 18 66 | | German National Research Center cell. p.: +49-179-101 33 40 | | for Information Technology (GMD) fax: +49- 30-63 92 18 05 | +--------------------------------------------------------------------+Received on Fri Jul 14 09:18:04 2000
This archive was generated by hypermail 2.1.8 : Wed 16 Nov 2005 06:07:06 PM GMT GMT