Combinatorial Constraints is a formal constraint modeling construct that specifies restrictions on the combinations of values that variables can simultaneously take, thereby defining feasible solutions within a discrete search space through logical and mathematical conditions.
255
Publications
11.9K
Citations
603
Authors
288
Institutions
Publications per year
2017–2026
63
Parents
Publications
255
1–5 of 255
Authors
603
- PV
5
h-index
- TW
4
h-index
- IM
4
h-index
- SS
4
h-index
- CZ
3
h-index
1–5 of 603
Institutions
288
Stanford University
Stanford, United States
7 h-index
13 publications
317 citations
Cornell University
Ithaca, United States
7 h-index
14 publications
339 citations
Georgia Institute of Technology
Atlanta, United States
6 h-index
9 publications
314 citations
University of Wisconsin–Madison
Madison, United States
5 h-index
11 publications
1.3K citations
Rutgers, The State University of New Jersey
New Brunswick, United States
5 h-index
18 publications
828 citations
Charles University
Prague, Czechia
5 h-index
6 publications
253 citations
Polytechnique Montréal
Montreal, Canada
5 h-index
18 publications
442 citations
Otto-von-Guericke-Universität Magdeburg
Magdeburg, Germany
4 h-index
8 publications
312 citations
1–8 of 288
Venues
- arXiv (Cornell University)
Repository · 20 publications · 629 citations
12
h-index
- European Journal of Operational Research
10 publications · 300 citations
10
h-index
- Proceedings of the AAAI Conference on Artificial Intelligence
Conference · 6 publications · 101 citations
6
h-index
- Operations Research
5 publications · 340 citations
5
h-index
- Journal of Artificial Intelligence Research
JAIR · 4 publications · 73 citations
4
h-index
1–5