Top Document: comp.constraints FAQ (Part 1 of 1) Previous Document: [1-8] Newsgroups Next Document: [1-10] Constraint libraries for Lisp and C See reader questions & answers on this topic! - Help others by sharing your knowledge ACC basketball scheduling problem <a href="http://www.ps.uni-sb.de/~walser/acc/acc.html">, an AMPL model and 0-1 IP instances of the original problem (presented by Nemhauser and Trick), J.P. Walser (University of Saarbruecken) Secretary's Nightmare scheduling problem CAIA-94 <http://cdr.stanford.edu/html/people/petrie/caia.html>, the workshop on Coordinated Design and Planning, March 1994, introduced the "secretary's nightmare" scheduling problem. CSP Lab (in Lisp) <ftp://ftp.cs.strath.ac.uk/local/pat/csp-lab> created by Patrick Prosser. There is also a Scheme version <ftp://ftp.cs.strath.ac.uk/local/pat/csp-lab.scm>. Algorithms include bt, bm, bj, cbj, fc, fc-cbj, and mac. CSPLib v2.0: a benchmark library for constraints compiled by Toby Walsh, Ian Gent, and Bart Selman. <http://csplib.cs.strath.ac.uk> <email:csplib@cs.strath.ac.uk> ECLiPSe Code Samples <http://www.icparc.ic.ac.uk/eclipse/examples/> The Munich Rent Advisor <http://www.pst.informatik.uni-muenchen.de/~fruehwir/miet-demo.html> was written using the CHR library of Eclipse <http://www.ecrc.de/eclipse/eclipse.html>, by Thom Fruehwirth <http://www.pst.informatik.uni-muenchen.de/~fruehwir/>. The Mystery Shopper benchmark <http://www.cs.unh.edu/ccc/archive/constraints/archive/mystery-shopper-bench mark.txt> was developed by Jimmy Ho Man Lee <jlee@cs.cuhk.hk> and introduced at CP'96. Neng-Fa Zhou <zhou@mse.kyutech.ac.jp> has developed a multi-layer channel router in CLP(FD), and hopes that the program can be used as a good benchmark for evaluating CLP(FD) systems. The program, and a number ofq other CLP benchmarks, are available from <ftp://ftp.kyutech.ac.jp/pub/Language/prolog/>. OR-Library <http://mscmga.ms.ic.ac.uk/info.html> of test data sets (Imperial College, J.E. Beasley) Planning and Scheduling <http://www.NeoSoft.com/~benchmrx/> Benchmarks (Barry Fox, Mark Ringer) Radio Link Frequency Assignment Problem can be found at the TU-Delft RLFAP archive <http://dutiosd.twi.tudelft.nl/~rlfap/> and on this site at <ftp://ftp.cs.unh.edu/pub/csp/archive/code/benchmarks/FullRLFAP/> Scheduling Benchmarks and Resources <http://fi-www.arc.nasa.gov/fia/projects/xfr/papers/benchmark-article.html> (A paper by Mark Drummond, NASA Ames Research Center; also a postscript <http://fi-www.arc.nasa.gov/fia/projects/xfr/papers/med-sigman.ps> version) Traffic Lights <http://www.cs.unh.edu/ccc/archive/constraints/archive/traffic.html> example by Walter Hower <http://yeats.ucc.ie/~walter/> TSP <http://www.iwr.uni-heidelberg.de/iwr/comopt/soft/TSPLIB95/TSPLIB.html> Travelling Salesman Problems library, maintained by Gerhard Reinelt (Gerhard.Reinelt@IWR.Uni-Heidelberg.de) Zebra Puzzle <http://www.ecrc.de/eclipse/html/extroot/node59.html> -- in Eclipse using CLP(Finite Domains) User Contributions:Top Document: comp.constraints FAQ (Part 1 of 1) Previous Document: [1-8] Newsgroups Next Document: [1-10] Constraint libraries for Lisp and C Part1 - Part2 - Single Page [ Usenet FAQs | Web FAQs | Documents | RFC Index ] Send corrections/additions to the FAQ Maintainer: pse@cs.unh.edu
Last Update March 27 2014 @ 02:11 PM
|
Comment about this article, ask questions, or add new information about this topic: