Finite Domain Constraint Programming is a constraint programming paradigm in which variables are assigned finite sets of integer values and constraints restrict the allowable combinations of values, distinguishing it by its focus on discrete, bounded domains for solving combinatorial problems.
42
Publications
1.4K
Citations
77
Authors
49
Institutions
Publications per year
2017–2026
2
Parents
Publications
42
Scheduling a Major College Basketball Conference—Revisited
Martin Henz · Operations Research · 2001 · 109 citations
Beyond the Glass Box: Constraints as Objects.
Jean‐François Puget, Michel Leconte · 1995 · 78 citations
1–5 of 42
Authors
77
- NZ
4
h-index
- EP
4
h-index
- AD
4
h-index
- DD
3
h-index
- AF
3
h-index
1–5 of 77
Institutions
49
University of Udine
Udine, Italy
4 h-index
5 publications
112 citations
New Mexico State University
Las Cruces, United States
4 h-index
4 publications
92 citations
University of Perugia
Perugia, Italy
4 h-index
5 publications
186 citations
Université Paris 1 Panthéon-Sorbonne
Paris, France
3 h-index
9 publications
197 citations
Brown University
Providence, United States
2 h-index
2 publications
86 citations
University of York
York, United Kingdom
2 h-index
6 publications
276 citations
The Graduate Center, CUNY
New York, United States
2 h-index
2 publications
98 citations
Computer Algorithms for Medicine
Graz, Austria
2 h-index
2 publications
20 citations
1–8 of 49
Venues
- Theory and Practice of Logic Programming
7 publications · 238 citations
7
h-index
- HAL (Le Centre pour la Communication Scientifique Directe)
Repository · 4 publications · 57 citations
4
h-index
- Artificial Intelligence
2 publications · 59 citations
2
h-index
- Lirias (KU Leuven)
Repository · 1 publications · 11 citations
1
h-index
- White Rose Research Online (University of Leeds, The University of Sheffield, University of York)
Repository · 1 publications · 65 citations
1
h-index
1–5