| maintained by | Ian P. Gent ipg@dcs.st-and.ac.uk | and | Toby Walsh tw@cs.york.ac.uk |
| with help from | Bart Selman selman@cs.cornell.edu |
prob001: car sequencing.
prob002: template design.
prob003: quasigroup existence.
prob004: mystery shopper.
prob005: low autocorellation binary sequences.
prob006: Golomb rulers.
prob007: all-interval series.
prob008: vessel loading.
prob009: perfect square placement.
prob010: social golfer problem.
prob011: ACC basketball schedule.
prob012: nonograms.
prob013: progressive party problem.
prob014: Solitaire Battleships.
prob015: Schur's lemma.
prob016: traffic lights.
prob017: Ramsey numbers.
prob018: water bucket problem.
prob019: magic squares and sequences.
prob020: darts tournament.
prob021: crossfigures.
prob022: bus driver scheduling.
prob023: magic hexagon.
prob024: Langford's number problem.
prob025: Lam's problem.
prob026: round robin tournaments.
prob027: alien tiles.
prob028: balanced incomplete block designs.
prob029: prime queen attacking problem.
prob030: balanced academic curriculum problem.
prob031: rack configuration problem.
prob032: maximum density still life.
prob033: word design for DNA computing on surfaces.
prob034: warehouse location problem..
prob035: Molnar's problem..
prob036: fixed length error correcting codes.
prob037: peg solitaire.
prob038: steel mill slab design problem.
prob039: rehearsal problem.
prob040: a distribution problem with Wagner-Whitin costs.
prob041: n-fractions puzzle.
prob042: circuit fault diagnosis.
prob043: differential fault diagnosis.
prob044: Steiner triple systems.
prob045: covering arrays.