Dataset 1: 62 Problems from CSPLib (www.csplib.org) Problem descriptions are taken from CSPLib unless a source is indicated. 001 - Car Sequencing 003 - QuasiGroups 004 - Mystery Shopper 006 - Golomb Rulers 007 - All-interval series 008 - Vessel loading 009 - Perfect square placement 010 - Social Golfer Problem 011 - ACC Basketball Scheduling 012 - Nonograms 013 - Progressive party 015 - Schur's Lemma 016 - Traffic lights 017 _ Ramsey numbers 017 _ Ramsey problem 018 - Water bucket problem 019 - Magic sequence 019 - Magic square 022 - Bus driver scheduling 023 - Magic hexagon 024 - Langford's number problem 025 - Lam's problem 026 - Sports tournament scheduling 028 - Balanced incomplete block design 029 - Prime queen attacking 030 - Balanced academic curriculum problem 031 - Rack configuration problem 032 - Still life 033 - Word design 034 - Warehouse location 035 - Molnar's problem (http://link.springer.com/chapter/10.1007%2F978-3-540-45193-8_22) 036 - Error correcting code (http://link.springer.com/chapter/10.1007%2F978-3-540-45193-8_22) 038 - Steel mill slab design 039 - Rehearsal problem 040 - Distribution problem with Wagner-Within costs (Figure and first part replaced with text from http://link.springer.com/chapter/10.1007/978-3-540-24664-0_21) 041 - N-fractions 044 - Steiner triple systems 045 - Covering arrays 048 - Minimum energy broadcast 049 - Number partitioning 050 - Diamond-free degree sequences 051 - Tank allocation 054 - N-queens 055 - EFPA (Equidistant Frequency Permutation Arrays) 056 - SONET (Synchronous Optical Networking) problem 057 - Killer Sudoku 059 - Energy-Cost Aware Scheduling 060 - Ridesharing 062 - Interview Assignment Problem 066 - Distance-Based Constrained Clustering 069 - Balanced Nursing Workload Problem 070 - Distributed Channel Assignment Problem 071 - Diameter and Degree Bounded Network Design Problem 072 - Target Tracking in Distributed Sensor Network 073 - Test Scheduling Problem 076 - Costas Arrays 077 - Stochastic Assignment and Scheduling Problem 079a - n-Queens Completion Problem 079b - Excluded Diagonals n-Queens Problem 080 - Blocked n-Queens Problem 081 - Black Hole 082 - Patient Transportation Problem ================================== Dataset 2: 21 Problems from ESSENCE (https://conjure.cs.st-andrews.ac.uk/EssenceCatalog/) Problem descriptions are taken from the indicated sources prob101: Stable Marriages Problem (http://www.dcs.gla.ac.uk/publications/PAPERS/7963/SARA024a.pdf) prob102: Worker Allocation (http://www.iaeng.org/publication/IMECS2009/IMECS2009_pp70-75.pdf) prob104: Travelling Tournament Problem (http://mat.tepper.cmu.edu/TOURN/ttp_ipcp.pdf) prob106: Temporal Knapsack Problem (http://link.springer.com/chapter/10.1007%2F11493853_5) prob107: Stable Set Problem (http://repository.cmu.edu/cgi/viewcontent.cgi?article=1536&context=tepper) prob108: Winner Determination Problem (http://www.cs.cmu.edu/afs/cs.cmu.edu/Web/People/sandholm/winner-determination-final.pdf) prob110: Peaceably Co-existing Armies of Queens (http://ipg.host.cs.st-andrews.ac.uk/papers/spgW9.pdf) prob111: Maximum Clique Problem (http://link.springer.com/chapter/10.1007%2F978-3-540-45193-8_43) prob112: Lot Sizing Problem (https://www.info.ucl.ac.be/~pschaus/assets/publi/cp2014_stocking.pdf) prob113: Doctors without Borders (http://link.springer.com/chapter/10.1007%2F978-3-540-24664-0_5) prob114: Subgraph Isomorphism (http://becool.info.ucl.ac.be/pub/papers/constraints2010_matching.pdf) prob115: Tail Assignment (http://link.springer.com/chapter/10.1007/978-3-540-24664-0_10) prob116: Vellino's Problem (http://cse.unl.edu/~choueiry/Documents/Regin/ppdp99.pdf) prob119: Celular Frequency Assignment (http://cse.unl.edu/~choueiry/Documents/Regin/ppdp99.pdf) prob123: Milk Collection ([1], see Dataset 4) prob126: Cryptarithmetic Puzzles (https://staff.fnwi.uva.nl/m.mazloom/Papers/mazloom,milad.pdf) prob127: Graph Colouring (Vertex coloring in https://en.wikipedia.org/wiki/Graph_coloring) prob128: Crossword Problem (http://link.springer.com/chapter/10.1007/3-540-45153-6_8) prob131: Production Line Sequencing (http://link.springer.com/chapter/10.1007/3-540-45153-6_9) prob132: A Layout Problem (http://cse.unl.edu/~choueiry/Documents/Meseguer-Torras-2001.pdf) prob133: Knapsack Problem (https://en.wikipedia.org/wiki/Knapsack_problem) ================================== Dataset 3: 8 Problems from MiniZinc (https://github.com/MiniZinc/minizinc-benchmarks) Problem descriptions are taken from MiniZinc unless a source is indicated. Carpet cutting (http://link.springer.com/chapter/10.1007%2F978-3-642-23786-7_8#page-1) Depot Placement MSPSP On-call rostering Open stack (http://ipg.host.cs.st-andrews.ac.uk/challenge) RCPSP Tents VRP (http://www.sciencedirect.com/science/article/pii/037722179290192C) ================================== Dataset 4: 34 Problems from OPL Examples given in [2] Problem descriptions are taken from [1] or [2] or an external source. [1] P. H. Williams. Model Building in Mathematical Programming. 5th Edition. Wiley, 2013. Avaiable at https://www.researchgate.net/file.PostFileLoader.html?id=546b5d0bd685cc9e2b8b45d4&assetKey=AS%3A273636437495809%401442251418466 [2] IBM ILOG CPLEX Optimization Studio v.12.8.0 Section IDE and OPL/Language and Interface Examples -> OPL Model Library -> OPL Examples that use CPLEX -> OPL Examples that use CP Optimizer Available at https://www.ibm.com/support/knowledgecenter/SSSA5P_12.8.0/ilog.odms.ide.help/OPL_Studio/usroplexamples/topics/opl_examples.html FINANCE Bid selection ([2]) Capital budgeting ([2]) Portfolio optimization (http://arxiv.org/pdf/1105.3594.pdf) MANIFACTURING Blending I (Problem 12.1 in [1], named Food manufacturing I) Economic planning (Problem 12.9 in [1]) Factory planning I (Problem 12.3 in [1]) Farm planning (Problem 12.8 in [1]) Flow-shop scheduling (http://dii.uchile.cl/~jcorrea/papers/Journals/CS2005.pdf) Assembly scheduling ([2]) Refinery planning (Problem 12.6 in [1]) Multi-machine assignment scheduling problem ([2]) Wood cutting problem ([2])) Pasta manufacturing ([2]) MINING Mine planning (Problem 12.7 in [1], named Mining) Opencast mining (Problem 12.14 in [1]) Well mining ([2]) SUPPLY CHAIN Decentralization (Problem 12.10 in [1]) Outsourcing ([2]) Product deployment ([2]) TIME TABLING Manpower planning (Problem 12.5 in [1]) Staff assignment ([2]) Nurse scheduling ([2]) Open-shop scheduling ([2]) Job-shop scheduling ([2]) TRANSPORTATION Air traffic flow management (http://journals.cambridge.org/download.php?file=%2FKER%2FKER27_03%2FS0269888912000240a.pdf&code=3bc8a27c3debbf40ae713db408d36660) Crew pairing (http://cgi.di.uoa.gr/~takis/pact96.pdf) Crew assignment (http://link.springer.com/article/10.1023%2FA%3A1013613701606) Fleet assignment ([2]) Network flows (https://www.me.utexas.edu/~jensen/ORMM/supplements/methods/netmethod/S1_pureflow.pdf) Traveling Salesman Problem ([2]) Trucking ([2]) Yield management (Problem 12.24 in [1]) COMBINATORIAL PROBLEMS Timetabling ([2]) Team building ([2])