Benchmark Ecsplain Application I

Benchmark Ecsplain Application II

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)
• DIMACS challenge benchmarks
  in graph colouring, clique finding, and satisfiability.
• MIPLIB
  a benchmark library of mixed integer programming problems (including scheduling and routing problems)
• PSPLIB
  a library of benchmark problems for project scheduling
• SATLIB
  a benchmark library of satisfiability problems
• TPTP
  a benchmark library for theorem proving
• MP-TESTDATA
  a benchmark library of Mathematical Programming problems (including routing and traveling salesman problems)
• TSP Travelling Salesman Problems library
  Maintained by Gerhard Reinelt (Gerhard.Reinelt@IWR.Uni-Heidelberg.de)

The Frequency Assignment Problem

ECSPLAIN testing FAP CELAR instances and SubInstances

• Download Instances and SubInstances
• In the benchmark document a Description and code to read instances exists
• Hints to solve instances by Thomas Schiex
• Very good overview of existing results

The classical problem and benchmarks

• A.Koster: specification, bibliography, benchmarks, news
• A very complete list of references and pointers
  • 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)
  
  
• The Mystery Shopper benchmark
  was developed by Jimmy Ho Man Lee and introduced at CP'96.
• Planning and Scheduling
  Benchmarks (Barry Fox, Mark Ringer)
• Traffic Lights
  Example by Walter Hower