Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
integer hull
Description:
The convex hull of the integer points contained in a polyhedron, a central object in integer and mixed-integer optimization.
Primary topic:
Complexity and Algorithms in Graphs (55%)
Related topics:
Complexity and Algorithms in Graphs (55%),
Advanced Optimization Algorithms Research (24%)
OpenAlex ID:
keywords/integer-hull
Faces for a linear inequality in 0–1 variables
1975
·
Laurence A. Wolsey
·
Mathematical Programming
·
349
Computing convex hulls and counting integer points with polymake
2016
·
Benjamin Assarf
, Ewgenij Gawrilow
, et al.
·
Mathematical Programming Computation
·
139
PDF
Sherali--Adams Relaxations and Indistinguishability in Counting Logics
2013
·
Albert Atserias
, Elitza Maneva
·
SIAM Journal on Computing
·
128
On integer points in polyhedra
1992
·
W. Cook
, M. Hartmann
, et al.
·
COMBINATORICA
·
95
Bounds on the Chv�tal Rank of Polytopes in the 0/1-Cube*
2003
·
Friedrich Eisenbrand
, Andreas S. Schulz
·
COMBINATORICA
·
72
Computing Two-Dimensional Integer Hulls
1999
·
Warwick Harvey
·
SIAM Journal on Computing
·
62
Cutting planes and the complexity of the integer hull
1989
·
Mark Hartmann
·
eCommons (Cornell University)
·
59
Projected Chvátal–Gomory cuts for mixed integer linear programs
2006
·
Pierre Bonami
, Gérard Cornuéjols
, et al.
·
Mathematical Programming
·
57
Further facet generating procedures for vertex packing polytopes
1976
·
Laurence A. Wolsey
·
Mathematical Programming
·
56
On the Chvátal rank of polytopes in the 0/1 cube
1999
·
Alexander Bockmayr
, Friedrich Eisenbrand
, et al.
·
Discrete Applied Mathematics
·
49
PDF
On the relative strength of split, triangle and quadrilateral cuts
2009
·
Amitabh Basu
, Pierre Bonami
, et al.
·
Mathematical Programming
·
48
PDF
An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets
2015
·
Austin Buchanan
, Je Sang Sung
, et al.
·
INFORMS journal on computing
·
41
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube
1999
·
Friedrich Eisenbrand
, Andreas S. Schulz
·
Lecture notes in computer science
·
40
Near-perfect matrices
1994
·
F. B. Shepherd
·
Mathematical Programming
·
35
Approximating polyhedra with sparse inequalities
2015
·
Santanu S. Dey
, Marco Molinaro
, et al.
·
Mathematical Programming
·
29
On Maximal S -Free Convex Sets
2011
·
Diego A. Morán R.
, Santanu S. Dey
·
SIAM Journal on Discrete Mathematics
·
29
How tight is the corner relaxation?
2007
·
Matteo Fischetti
, Michele Monaci
·
Discrete Optimization
·
27
PDF
On the Unlimited Number of Faces in Integer Hulls of Linear Programs with a Single Constraint
1970
·
David S. Rubin
·
Operations Research
·
27
Aggregation-based cutting-planes for packing and covering integer programs
2017
·
Merve Bodur
, Alberto Del Pia
, et al.
·
Mathematical Programming
·
26
PDF
Sherali-Adams relaxations and indistinguishability in counting logics
2012
·
Albert Atserias
, Elitza Maneva
·
Conference on Innovations in Theoretical Computer Science
·
24
On the Matrix Cuts of Lovász and Schrijver and Their Use in Integer Programming
2001
·
Sanjeeb Dash
·
Rice Research Repository (Rice University)
·
23
The Integer Hull of a Convex Rational Polytope
2004
·
Jean B. Lasserre
·
Discrete & Computational Geometry
·
22
PDF
Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
2005
·
Dion Gijswijt
·
SIAM Journal on Discrete Mathematics
·
20
PDF
Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
2017
·
Jörg Bader
, Robert Hildebrand
, et al.
·
Mathematical Programming
·
18
PDF
Integer hulls of linear polyhedra and scl in families
2013
·
Danny Calegari
, Alden Walker
·
Transactions of the American Mathematical Society
·
18
PDF
Show more works
View as search
Works count:
141
Citation count:
1,962
Year
Topic
Type