Dynamic Variable Ordering
Dynamic Variable Ordering is a variable selection strategy in branch and bound algorithms that dynamically prioritizes decision variables based on evolving problem state information to improve search efficiency.
51
Publications
3.7K
Citations
103
Authors
58
Institutions
Publications per year
2017–2026
3
Parents
51
Boosting systematic search by weighting constraints
Frédéric Boussemart, Fred Hémery, Christophe Lecoutre et al. · 2004 · 399 citations
1–5 of 51
103
8
h-index
5
h-index
5
h-index
3
h-index
3
h-index
1–5 of 103
58

University of Freiburg
Freiburg im Breisgau, Germany
8 h-index
12 publications
414 citations
University of Colorado Boulder
Boulder, United States
5 h-index
8 publications
780 citations
University of California, Irvine
Irvine, United States
4 h-index
8 publications
478 citations

University of Waterloo
Waterloo, Canada
2 h-index
3 publications
144 citations

University of Regina
Regina, Canada
2 h-index
4 publications
106 citations

Technische Universität Darmstadt
Darmstadt, Germany
2 h-index
2 publications
30 citations
Synopsys (United States)
Mountain View, United States
2 h-index
2 publications
1.3K citations
Universitat Politècnica de Catalunya
Barcelona, Spain
2 h-index
3 publications
40 citations
1–8 of 58
3 publications · 173 citations
3
h-index
JAIR · 3 publications · 129 citations
3
h-index
Conference · 2 publications · 1K citations
2
h-index
Conference · 2 publications · 106 citations
2
h-index
1 publications · 11 citations
1
h-index
1–5