CSPLib

CSPLib is a library of test problems for constraint solvers. The library consists of: problems organised by subject area and problem number guidelines for submitting new problems a paper about the library (in postscript or html) and its bibtex reference (also available from the APES technical report page) a list of related benchmark libraries links to constraint solvers a history of changes to the library a tar file of version 2.1 of the library (and version 2.0) The main motivation for CSPLib is to focus research in constraints away from purely random problems and onto more structured problems.


References in zbMATH (referenced in 91 articles )

Showing results 1 to 20 of 91.
Sorted by year (citations)

1 2 3 4 5 next

  1. Mechqrane, Younes; Wahbi, Mohamed; Bessiere, Christian; Brown, Kenneth N.: Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems (2020)
  2. Paquay, Célia; Crama, Yves; Pironet, Thierry: Recovery management for a dial-a-ride system with real-time disruptions (2020)
  3. Laborie, Philippe; Rogerie, Jérôme; Shaw, Paul; Vilím, Petr: IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG (2018)
  4. Yavuz, Mesut; Ergin, Hüseyin: Advanced constraint propagation for the combined car sequencing and level scheduling problem (2018)
  5. Bessiere, Christian; Koriche, Frédéric; Lazaar, Nadjib; O’Sullivan, Barry: Constraint acquisition (2017)
  6. Cohen, David A.; Jeavons, Peter G.: The power of propagation: when GAC is enough (2017)
  7. Lee, Jimmy H. M.; Zhu, Zichen: Towards breaking more composition symmetries in partial symmetry breaking (2017)
  8. Leo, Kevin; Tack, Guido: Debugging unsatisfiable constraint models (2017)
  9. Nightingale, Peter; Akgün, Özgür; Gent, Ian P.; Jefferson, Christopher; Miguel, Ian; Spracklen, Patrick: Automatically improving constraint models in Savile Row (2017)
  10. Perez, Guillaume; Régin, Jean-Charles: MDDs are efficient modeling tools: an application to some statistical constraints (2017)
  11. Scott, Joseph D.; Flener, Pierre; Pearson, Justin; Schulte, Christian: Design and implementation of bounded-length sequence variables (2017)
  12. Sutcliffe, Geoff: The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0 (2017)
  13. van Cauwelaert, Sascha; Schaus, Pierre: Efficient filtering for the resource-cost alldifferent constraint (2017)
  14. Amadini, Roberto; Gabbrielli, Maurizio; Mauro, Jacopo: Why CP portfolio solvers are (under)utilized? issues and challenges (2015)
  15. Caniou, Yves; Codognet, Philippe; Richoux, Florian; Diaz, Daniel; Abreu, Salvador: Large-scale parallelism for constraint-based local search: the costas array case study (2015)
  16. Lardeux, Frédéric; Monfroy, Eric; Crawford, Broderick; Soto, Ricardo: Set constraint model and automated encoding into SAT: application to the social golfer problem (2015)
  17. Mears, Christopher; de la Banda, Maria Garcia; Wallace, Mark; Demoen, Bart: A method for detecting symmetries in constraint models and its generalisation (2015)
  18. Pesant, Gilles: Achieving domain consistency and counting solutions for dispersion constraints (2015)
  19. Artigues, Christian; Hebrard, Emmanuel; Mayer-Eichberger, Valentin; Siala, Mohamed; Walsh, Toby: SAT and hybrid models of the car sequencing problem (2014)
  20. Ceschia, Sara; Di Gaspero, Luca; Schaerf, Andrea: The generalized balanced academic curriculum problem with heterogeneous classes (2014)

1 2 3 4 5 next