Benchmarks Libraries

• CSPLib
  Short Paper in CP99: "Csplib: A benchmark library for constraints"
  Maintained by Ian P. Gent
  Problems described in natural language with available data, references, and posted results
• OR-Library
  OR-Library is a collection of test data sets for a variety of Operations Research (OR) problems. (Imperial College, J.E. Beasley)

The Frequency Assignment Problem

• A.Koster: specification, bibliography, benchmarks, news
• A very complete list of references and pointers

  The classical problem and benchmarks

  • CELAR
    • Page de Thomas Schiex. Contains a detailed description of the problems and pointers. Presently in French but a translation in English is under way.
    • CERT-ONERA (Toulouse). ftp server. Contains a description of the format: file celar.blurb.old
    • Eindhoven (ftp server)

  FAP with polarisaton and soft constraints relaxable at different levels

  • Challenge 2001 subject

  The Radio Frequency Assignment benchmarks

  • Provided by France Telecom at Steve Hurley page

Other specific benchmarks

• Problemes recollected by J.P.Waler that have been solved by Integer 0-1 optimization algorithms
  
  • Radar surveillance problems
    Covering-type pseudo-Boolean (0-1 integer) problems (Seif Haridi, Per Brand (SICS), J.P. Walser (University of Saarbruecken))
  • The Progressive Party Problem
    A collection of variations of Smith et.al's problem in pseduo-Boolean (0-1 integer) encoding (maintained by J.P. Walser, University of Saarbruecken)
  • The ACC basketball scheduling problem , an AMPL model and 0-1 IP instances of the original problem (presented by Nemhauser and Trick), J.P. Walser (University of Saarbruecken)
  
  
• CAIA-94
  The workshop on Coordinated Design and Planning, March 1994, introduced the "secretary's nightmare" scheduling problem.
• The Mystery Shopper benchmark
  was developed by Jimmy Ho Man Lee and introduced at CP'96.
• Neng-Fa Zhou
  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/benchmarks.tar.gz .
• Planning and Scheduling
  Benchmarks (Barry Fox, Mark Ringer)
• Traffic Lights
  Example by Walter Hower
• TSP Travelling Salesman Problems library
  Maintained by Gerhard Reinelt (Gerhard.Reinelt@IWR.Uni-Heidelberg.de)