Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results

Edmonds polytopes and a hierarchy of combinatorial problems

Vašek Chvátal · Discrete Mathematics · 1973 · 619 citations

Natural Sciences, Computer Science, Mathematics +9

On the facial structure of set packing polyhedra

Manfred Padberg · Mathematical Programming · 1973 · 588 citations

Architecture, Computational Design, Computational Geometry +4

A Column Generation Approach for Graph Coloring

Anuj Mehrotra, Michael A. Trick · INFORMS journal on computing · 1996 · 404 citations

Natural Sciences, Computer Science, Mathematics +14

Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems

Cynthia Barnhart, Christopher A. Hane, Pamela H. Vance · Operations Research · 2000 · 317 citations

Natural Sciences, Industrial Engineering, Operations Management +17

On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}

Egon Balas · Mathematical Programming · 1989 · 94 citations

Natural Sciences, Computer Science, Mathematics +5