![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Constraints - An International Journal, Volume 29
Volume 29, Number 1-2, June 2024
- David Cushing, David I. Stewart
:
Applying constraint programming to minimal lottery designs. 1-21 - Andreas Plank
, Sibylle Möhle
, Martina Seidl
:
Counting QBF solutions at level two. 22-39 - Joan Espasa
, Ian Miguel, Peter Nightingale, András Z. Salamon, Mateu Villaret:
Plotting: a case study in lifted planning with constraints. 40-79 - Arnold Hien
, Noureddine Aribi
, Samir Loudni
, Yahia Lebbah
, Abdelkader Ouali
, Albrecht Zimmermann
:
Mining diverse sets of patterns with constraint programming using the pairwise Jaccard similarity relaxation. 80-111 - Maxime Mulamba
, Jayanta Mandi
, Ali Irfan Mahmutogullari
, Tias Guns
:
Perception-based constraint solving for sudoku images. 112-151 - Michel Medema
, Luc Breeman, Alexander Lazovik:
Limiting the memory consumption of caching for detecting subproblem dominance in constraint problems. 152-191 - Fabio Tardivo
, Agostino Dovier, Andrea Formisano, Laurent Michel, Enrico Pontelli:
Constraint propagation on GPU: a case study for the cumulative constraint. 192-214
Volume 29, Number 3-4, December 2024
- Gennaro Auricchio, Luca Ferrarini
, Stefano Gualandi, Greta Lanzarotto, Ludovico Pernazza:
Computing aperiodic tiling rhythmic canons via SAT models. 215-233 - Tom Marty, Léo Boisvert, Tristan François, Pierre Tessier, Louis Gautier, Louis-Martin Rousseau, Quentin Cappart
:
Learning and fine-tuning a generic value-selection heuristic inside a constraint programming solver. 234-260 - Serdar Kadioglu
, Parag Pravin Dakle, Karthik Uppuluri, Regina Politi, Preethi Raghavan, SaiKrishna Rallabandi, Ravisutha Srinivasamurthy:
Ner4Opt: named entity recognition for optimization modelling from natural language. 261-299 - John M. Neuberger, Nándor Sieben, James W. Swift
:
Invariant polydiagonal subspaces of matrices and constraint programming. 300-314
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.