Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
- Sanjeeb Dash
- Santanu S. Dey
- et al.
- 2011
- Mathematical Programming
Publications
This is our catalog of publications authored by IBM researchers, in collaboration with the global research community. It’s an ever-growing body of work that shows why IBM is one of the most important contributors to modern computing.
Date
Featured collections
Popular topics
51 results for Oktay Günlük
A note on the MIR closure and basic relaxations of polyhedra
- Sanjeeb Dash
- Oktay Günlük
- et al.
- 2011
- Operations Research Letters
Strengthening lattice-free cuts using non-negativity
- Ricardo Fukasawa
- Oktay Günlük
- 2011
- Discrete Optimization
The master equality polyhedron with multiple rows
- Sanjeeb Dash
- Ricardo Fukasawa
- et al.
- 2010
- Mathematical Programming
Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Oktay Günlük
- Jeff Linderoth
- 2010
- Mathematical Programming
Two-step MIR inequalities for mixed integer programs
- Sanjeeb Dash
- Marcos Goycoolea
- et al.
- 2010
- INFORMS Journal on Computing
On mixing inequalities: Rank, closure, and cutting-plane proofs
- Sanjeeb Dash
- Oktay Günlük
- 2009
- SIAM Journal on Optimization
On a generalization of the master cyclic group polyhedron
- Sanjeeb Dash
- Ricardo Fukasawa
- et al.
- 2008
- Mathematical Programming
MIR closures of polyhedral sets
- Sanjeeb Dash
- Oktay Günlük
- et al.
- 2008
- Mathematical Programming
A pricing problem under Monge property
- Oktay Günlük
- 2008
- Discrete Optimization