Interval Scheduling
Interval Scheduling is a computational optimization problem in algorithm design that involves selecting a maximum-cardinality subset of non-overlapping intervals from a given set of time intervals.
250
Publications
11.6K
Citations
594
Authors
337
Institutions
Publications per year
2017–2026
56
250
Generalized arc consistency for global cardinality constraint
Jean-Charles Régin · 1996 · 318 citations
1–5 of 250
594
7
h-index
5
h-index
4
h-index
4
h-index
4
h-index
1–5 of 594
337
Technion – Israel Institute of Technology
Haifa, Israel
10 h-index
16 publications
1.1K citations
United Institute of Informatics Problems
Minsk, Belarus
6 h-index
10 publications
370 citations

Wrocław University of Science and Technology
Wroclaw, Poland
5 h-index
10 publications
220 citations

National Academy of Sciences of Belarus
Minsk, Belarus
5 h-index
8 publications
282 citations

Centre National de la Recherche Scientifique
Paris, France
5 h-index
9 publications
261 citations
Northeast Electric Power University
Jilin City, China
4 h-index
19 publications
1.2K citations

Zhengzhou University
Zhengzhou, China
4 h-index
13 publications
352 citations
KU Leuven
Leuven, Belgium
4 h-index
4 publications
298 citations
1–8 of 337
11 publications · 673 citations
10
h-index
7 publications · 356 citations
7
h-index
7 publications · 298 citations
7
h-index
7 publications · 219 citations
7
h-index
7 publications · 246 citations
7
h-index
1–5