| Publication | Date of Publication | Type |
|---|
On polytopes with linear rank with respect to generalizations of the split closure
Discrete Optimization | 2024-03-27 | Paper |
Multilinear sets with two monomials and cardinality constraints
Discrete Applied Mathematics | 2022-11-11 | Paper |
On a generalization of the Chvátal-Gomory closure
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
On a generalization of the Chvátal-Gomory closure
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Generalized Chvátal-Gomory closures for integer programs with bounds on variables
Mathematical Programming. Series A. Series B | 2021-10-20 | Paper |
Cardinality constrained multilinear sets
| 2021-02-04 | Paper |
Convexifying Multilinear Sets with Cardinality Constraints: Structural Properties, Nested Case and Extensions
| 2020-07-30 | Paper |
Lattice closures of polyhedra
Mathematical Programming. Series A. Series B | 2020-06-10 | Paper |
Comments on: ``Perspectives on integer programming for time-dependent models
Top | 2019-07-11 | Paper |
Binary extended formulations of polyhedral mixed-integer sets
Mathematical Programming. Series A. Series B | 2018-07-13 | Paper |
On the relative strength of different generalizations of split cuts
Discrete Optimization | 2018-05-24 | Paper |
Optimization over structured subsets of positive semidefinite matrices via column generation
Discrete Optimization | 2018-05-24 | Paper |
A new lift-and-project operator
European Journal of Operational Research | 2018-05-24 | Paper |
Binary Extended Formulations
| 2018-01-03 | Paper |
On the polyhedrality of closures of multibranch split sets and other polyhedra with bounded max-facet-width
SIAM Journal on Optimization | 2017-07-27 | Paper |
Strengthened benders cuts for stochastic integer programs with continuous recourse
INFORMS Journal on Computing | 2017-06-02 | Paper |
Cutting planes from extended LP formulations
Mathematical Programming. Series A. Series B | 2017-02-03 | Paper |
On the polyhedrality of cross and quadrilateral closures
Mathematical Programming. Series A. Series B | 2016-11-25 | Paper |
A time bucket formulation for the traveling salesman problem with time windows
INFORMS Journal on Computing | 2016-06-29 | Paper |
The continuous knapsack set
Mathematical Programming. Series A. Series B | 2016-02-23 | Paper |
Computational experiments with cross and crooked cross cuts
INFORMS Journal on Computing | 2015-01-26 | Paper |
Mixed integer rounding cuts and master group polyhedra
| 2014-11-10 | Paper |
Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
Mathematical Programming. Series A. Series B | 2014-06-27 | Paper |
On \(t\)-branch split cuts for mixed-integer programs
Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
On some generalizations of the split closure
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
Mathematical Programming. Series A. Series B | 2012-10-15 | Paper |
Numerically safe Gomory mixed-integer cuts
INFORMS Journal on Computing | 2012-07-28 | Paper |
Two-step MIR inequalities for mixed integer programs
INFORMS Journal on Computing | 2012-07-28 | Paper |
Solution of a min-max vehicle routing problem
INFORMS Journal on Computing | 2012-05-30 | Paper |
The master equality polyhedron with multiple rows
Mathematical Programming. Series A. Series B | 2012-04-27 | Paper |
On mixed-integer sets with two integer variables
Operations Research Letters | 2012-04-05 | Paper |
A note on the MIR closure and basic relaxations of polyhedra
Operations Research Letters | 2011-08-19 | Paper |
A heuristic to generate rank-1 GMI cuts
Mathematical Programming Computation | 2011-01-28 | Paper |
On a generalization of the master cyclic group polyhedron
Mathematical Programming. Series A. Series B | 2010-10-13 | Paper |
On mixing inequalities: rank, closure, and cutting-plane proofs
SIAM Journal on Optimization | 2010-06-01 | Paper |
On the complexity of cutting-plane proofs using split cuts
Operations Research Letters | 2010-05-07 | Paper |
Erratum to: MIR closures of polyhedral sets
Mathematical Programming. Series A. Series B | 2010-04-15 | Paper |
MIR closures of polyhedral sets
Mathematical Programming. Series A. Series B | 2010-02-19 | Paper |
On the strength of Gomory mixed-integer cuts as group cuts
Mathematical Programming. Series A. Series B | 2008-10-16 | Paper |
On Nearly Orthogonal Lattice Bases and Random Lattices
SIAM Journal on Discrete Mathematics | 2008-03-28 | Paper |
Projected Chvátal-Gomory cuts for mixed integer linear programs
Mathematical Programming. Series A. Series B | 2008-03-12 | Paper |
Exact solutions to linear programming problems
Operations Research Letters | 2008-01-21 | Paper |
On the MIR Closure of Polyhedra
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
On a Generalization of the Master Cyclic Group Polyhedron
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Valid inequalities based on the interpolation procedure
Mathematical Programming. Series A. Series B | 2006-05-02 | Paper |
Valid inequalities based on simple mixed-integer sets
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs
Mathematics of Operations Research | 2005-11-11 | Paper |
scientific article; zbMATH DE number 2086919 (Why is no real title available?)
| 2004-08-11 | Paper |
On the matrix-cut rank of polyhedra.
Mathematics of Operations Research | 2001-11-26 | Paper |
