CarSequencing.py
|
001: Car Sequencing
|
|
TemplateDesign.py
|
002: Template Design
|
|
QuasiGroup.py
|
003: Quasigroup Existence
|
|
MisteryShopper.py
|
004: Mystery Shopper
|
|
LowAutocorrelation.py
|
005: Low Autocorrelation Binary Sequences
|
|
Golombruler.py
|
006: Golomb rulers
|
|
AllInterval.py
|
007: All-Interval Series
|
|
VesselLoading.py
|
008: Vessel Loading
|
|
RectPacking.py
|
009: Perfect Square Placement
|
|
SocialGolfers.py
|
010: Social Golfers Problem
|
|
Nonogram.py
|
012: Nonogram
|
|
ProgressiveParty.py
|
013: Progressive Party Problem
|
|
SolitaireBattleship.py
|
014: Solitaire Battleships
|
|
SchurrLemma.py
|
015: Schur's Lemma
|
|
TrafficLights.py
|
016: Traffic Lights
|
|
Ramsey.py
|
017: Ramsey Numbers
|
|
WaterBucket.py
|
018: Water Bucket Problem
|
|
Magicsequence.py
|
019: Magic Squares and Sequences
|
|
Magicsquare.py
|
019: Magic Squares and Sequences
|
|
BusScheduling.py
|
022: Bus Driver Scheduling
|
|
Magichexagon.py
|
023: Magic Hexagon
|
|
LangfordNumber.py
|
024: Langford's number problem
|
|
SportsScheduling.py
|
026: Sports Tournament Scheduling
|
|
BIBD.py
|
028: Balanced Incomplete Block Designs
|
|
QueenAttacking.py
|
029: Prime queen attacking problem
|
|
Bacp.py
|
030: Balanced Academic Curriculum Problem (BACP)
|
|
Rack.py
|
031: Rack Configuration Problem
|
|
StillLife.py
|
032: Maximum density still life
|
|
WordDesign.py
|
033: Word Design for DNA Computing on Surfaces
|
|
WarehouseLocation.py
|
034: Warehouse Location Problem
|
|
Molnar.py
|
035: Molnar's Problem
|
|
PegSolitaire.py
|
037: Peg Solitaire
|
|
PegSolitaire_Generator.py
|
037: Peg Solitaire
|
|
SteelMillSlab.py
|
038: Steel Mill Slab Design
|
|
Rehearsal.py
|
039: The Rehearsal Problem
|
|
Nfractions.py
|
041: The n-Fractions Puzzle
|
|
Diagnosis.py
|
042: diagnosis
|
|
Steiner3.py
|
044: Steiner triple systems
|
|
CoveringArray.py
|
045: The Covering Array Problem
|
|
Numberpartitioning.py
|
049: Number Partitioning
|
|
DiamondFree.py
|
050: Diamond-free Degree Sequences
|
|
GracefulGraph.py
|
053: Graceful Graphs
|
|
Queens.py
|
054: N-Queens
|
|
Sonet.py
|
056: Synchronous Optical Networking (SONET) Problem
|
|
Rcpsp.py
|
061: Resource-Constrained Project Scheduling Problem (RCPSP)
|
|
Auction.py
|
063: Winner Determination Problem (Combinatorial Auction)
|
|
Opd.py
|
065: Optimal Financial Portfolio Design
|
|
TravelingTournamentWithPredefinedVenues.py
|
068: Traveling Tournament Problem with Predefined Venues (TTPPV)
|
|
NursingWorkload.py
|
069: Balanced Nursing Workload Problem
|
|
Clique.py
|
074: Maximum Clique
|
|
CostasArray.py
|
076: Costas Arrays
|
|
BlockedQueens.py
|
080: Blocked n-Queens Problem
|
|
Blackhole.py
|
081: Black Hole
|
|
Hadamard.py
|
084: 2cc Hadamard matrix Legendre pairs
|
|
CVRP.py
|
086: Capacitated Vehicle Routing Problem
|
|
PeacableArmies.py
|
110: Peaceably Co-existing Armies of Queens
|
|
Vellino.py
|
116: Vellino's Problem
|
|
Layout.py
|
132: A Layout Problem
|
|
Knapsack.py
|
133: Knapsack Problem
|
|