Constraint Programming

Constraint Programming is a declarative paradigm for modeling and solving combinatorial decision and optimization problems in which decisions are represented by variables with associated domains and constraints specifying allowable value combinations, and solutions are derived through systematic search combined with constraint propagation rather than explicit procedural algorithms.

2.3K

Publications

116.3K

Citations

3.7K

Authors

1.2K

Institutions

Publications per year

2017–2026

314

Authors

3.7K

  1. PV
    Pascal Van Hentenryck

    Brown University, United States

    43 publications · 2.4K citations

    23

    h-index

  2. EC
    Eugene C. Freuder

    University of New Hampshire, United States

    34 publications · 2.9K citations

    22

    h-index

  3. TW
    Toby Walsh

    Data61, Australia

    26 publications · 1.1K citations

    22

    h-index

  4. PJ
    Peter J. Stuckey

    The University of Melbourne, Australia

    35 publications · 2.1K citations

    21

    h-index

  5. CB
    Christian Bessière

    Centre National de la Recherche Scientifique, France

    23 publications · 1.4K citations

    19

    h-index

1–5 of 3.7K

Venues

  1. Artificial Intelligence

    71 publications · 10.5K citations

    45

    h-index

  2. Constraints

    56 publications · 2.8K citations

    28

    h-index

  3. European Journal of Operational Research

    33 publications · 1.7K citations

    23

    h-index

  4. Computers & Operations Research

    30 publications · 1.4K citations

    23

    h-index

  5. Theory and Practice of Logic Programming

    36 publications · 1.2K citations

    22

    h-index

1–5