Polyhedral Theory

Polyhedral Theory is a branch of mathematical optimization that studies the geometric and combinatorial properties of convex polyhedra associated with integer programs, distinguishing itself by characterizing the structure of feasible solutions through valid inequalities, facets, and convex hull descriptions to enable algorithmic development and strengthening of formulations.

703

Publications

31.2K

Citations

1.3K

Authors

605

Institutions

Publications per year

2017–2026

65

Authors

1.3K

  1. GL
    George L. Nemhauser

    Georgia Institute of Technology, United States

    9 publications · 410 citations

    9

    h-index

  2. MF
    Matteo Fischetti

    University of Padua, Italy

    8 publications · 561 citations

    8

    h-index

  3. MS
    Martin Savelsbergh

    Georgia Institute of Technology, United States

    7 publications · 269 citations

    7

    h-index

  4. ML
    Martine Labbé

    Université Libre de Bruxelles, Belgium

    6 publications · 386 citations

    6

    h-index

  5. GL
    Gilbert Laporte

    HEC Montréal, Canada

    6 publications · 548 citations

    6

    h-index

1–5 of 1.3K

Venues

  1. Mathematical Programming

    37 publications · 3K citations

    26

    h-index

  2. Mathematics of Operations Research

    32 publications · 1.6K citations

    21

    h-index

  3. Operations Research

    23 publications · 1.9K citations

    19

    h-index

  4. Networks

    14 publications · 761 citations

    14

    h-index

  5. Discrete Applied Mathematics

    17 publications · 965 citations

    13

    h-index

1–5