This work is licensed under a Creative Commons Attribution 4.0 International License. prob035 : Molnar's Problem
prob036 : Fixed Length Error Correcting Codes
prob041 : The n-Fractions Puzzle
prob050 : Diamond-free Degree Sequences
prob052 : Extremal Graphs with Small Girth
prob046 : Meeting Scheduling
prob037 : Peg Solitaire
prob037 : Peg Solitaire
prob040 : A Distribution Problem with Wagner-Whitin Costs
prob001 : Car Sequencing
prob002 : Template Design
prob032 : Maximum density still life
prob039 : The Rehearsal Problem
prob059 : Energy-Cost Aware Scheduling
prob071 : Diameter and Degree Bounded Network Design Problem
prob059 : Energy-Cost Aware Scheduling
prob047 : Supply Chain Coordinations
prob054 : N-Queens
prob030 : Balanced Academic Curriculum Problem (BACP)
prob031 : Rack Configuration Problem
prob034 : Warehouse Location Problem
prob071 : Diameter and Degree Bounded Network Design Problem
prob082 : Patient Transportation Problem
prob035 : Molnar's Problem
prob036 : Fixed Length Error Correcting Codes
prob037 : Peg Solitaire
prob029 : Prime queen attacking problem
prob041 : The n-Fractions Puzzle
prob074 : Maximum Clique
prob049 : Number Partitioning
prob047 : Supply Chain Coordinations
prob048 : Minimum Energy Broadcast (MEB)
prob090 : Wordpress application deployment in the Cloud
prob077 : Stochastic Assignment and Scheduling Problem
prob059 : Energy-Cost Aware Scheduling
prob071 : Diameter and Degree Bounded Network Design Problem
prob061 : Resource-Constrained Project Scheduling Problem (RCPSP)
prob045 : The Covering Array Problem
prob085 : Bookshelves
prob070 : Distributed Channel Assignment Problem
prob042 : diagnosis
prob043 : differential diagnosis
prob044 : Steiner triple systems
prob012 : Nonogram
prob067 : Quasigroup Completion
prob068 : Traveling Tournament Problem with Predefined Venues (TTPPV)
prob069 : Balanced Nursing Workload Problem
prob009 : Perfect Square Placement
prob059 : Energy-Cost Aware Scheduling
prob062 : Interview Assignment Problem
prob007 : All-Interval Series
prob012 : Nonogram
prob014 : Solitaire Battleships
prob027 : Alien Tiles Problem
prob079 : n-Queens Completion Problem and Excluded Diagonals n-Queens Problem
prob080 : Blocked n-Queens Problem
prob035 : Molnar's Problem
prob036 : Fixed Length Error Correcting Codes
prob037 : Peg Solitaire
prob038 : Steel Mill Slab Design
prob040 : A Distribution Problem with Wagner-Whitin Costs
prob041 : The n-Fractions Puzzle
prob084 : 2cc Hadamard matrix Legendre pairs
prob064 : Generalised Balanced Academic Curriculum Problem
prob065 : Optimal Financial Portfolio Design
prob004 : Mystery Shopper
prob088 : Plotting
prob053 : Graceful Graphs
prob008 : Vessel Loading
prob047 : Supply Chain Coordinations
prob048 : Minimum Energy Broadcast (MEB)
prob058 : Discrete Lot Sizing Problem
prob082 : Patient Transportation Problem
prob071 : Diameter and Degree Bounded Network Design Problem
prob033 : Word Design for DNA Computing on Surfaces
prob052 : Extremal Graphs with Small Girth
prob059 : Energy-Cost Aware Scheduling
prob072 : Target Tracking in Distributed Sensor Network
prob073 : Test Scheduling Problem
prob047 : Supply Chain Coordinations
prob050 : Diamond-free Degree Sequences
prob052 : Extremal Graphs with Small Girth
prob063 : Winner Determination Problem (Combinatorial Auction)
prob055 : Equidistant Frequency Permutation Arrays
prob056 : Synchronous Optical Networking (SONET) Problem
prob057 : Killer Sudoku
prob061 : Resource-Constrained Project Scheduling Problem (RCPSP)
prob081 : Black Hole
prob052 : Extremal Graphs with Small Girth
prob006 : Golomb rulers
prob065 : Optimal Financial Portfolio Design
prob051 : Tank Allocation
prob058 : Discrete Lot Sizing Problem
prob075 : Product Matrix Travelling Salesman Problem
prob078 : Train Traffic Rescheduling
prob082 : Patient Transportation Problem
prob078 : Train Traffic Rescheduling
prob082 : Patient Transportation Problem
prob046 : Meeting Scheduling
prob075 : Product Matrix Travelling Salesman Problem
prob076 : Costas Arrays
prob028 : Balanced Incomplete Block Designs
prob022 : Bus Driver Scheduling
prob087 : Rotating Rostering Problem
prob066 : Distance-Based Constrained Clustering
prob003 : Quasigroup Existence
prob005 : Low Autocorrelation Binary Sequences
prob011 : ACC Basketball Schedule
prob013 : Progressive Party Problem
prob015 : Schur's Lemma
prob016 : Traffic Lights
prob017 : Ramsey Numbers
prob018 : Water Bucket Problem
prob019 : Magic Squares and Sequences
prob020 : Darts Tournament
prob021 : Crossfigures
prob023 : Magic Hexagon
prob024 : Langford's number problem
prob025 : Lam's Problem
prob026 : Sports Tournament Scheduling
prob030 : Balanced Academic Curriculum Problem (BACP)
prob041 : The n-Fractions Puzzle
prob046 : Meeting Scheduling
prob058 : Discrete Lot Sizing Problem
prob060 : Ridesharing
prob016 : Traffic Lights
prob010 : Social Golfers Problem
prob058 : Discrete Lot Sizing Problem
prob030 : Balanced Academic Curriculum Problem (BACP)
prob031 : Rack Configuration Problem
prob131 : Production Line Sequencing
prob076 : Costas Arrays
prob083 : Transshipment problem
prob086 : Capacitated Vehicle Routing Problem
prob110 : Peaceably Co-existing Armies of Queens
prob115 : Tail Assignment
prob116 : Vellino's Problem
prob131 : Production Line Sequencing
prob132 : A Layout Problem
prob133 : Knapsack Problem
This work is licensed under a Creative Commons Attribution 4.0 International License.