The following pages link to Oktay Günlük (Q202051):
Displaying 50 items.
- On the polyhedrality of cross and quadrilateral closures (Q344941) (← links)
- On \(t\)-branch split cuts for mixed-integer programs (Q378102) (← links)
- On mixed-integer sets with two integer variables (Q408383) (← links)
- Strengthening lattice-free cuts using non-negativity (Q429683) (← links)
- Discretization vertex orders in distance geometry (Q499358) (← links)
- Cutting planes from extended LP formulations (Q507316) (← links)
- A note on the MIR closure and basic relaxations of polyhedra (Q635512) (← links)
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra (Q715090) (← links)
- MIR closures of polyhedral sets (Q847821) (← links)
- On the strength of Gomory mixed-integer cuts as group cuts (Q948966) (← links)
- A pricing problem under Monge property (Q951107) (← links)
- Mingling: mixed-integer rounding with bounds (Q964180) (← links)
- Erratum to: MIR closures of polyhedral sets (Q964184) (← links)
- Minimum cost capacity installation for multicommodity network flows (Q1290614) (← links)
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
- Binary extended formulations of polyhedral mixed-integer sets (Q1650775) (← links)
- On the relative strength of different generalizations of split cuts (Q1751106) (← links)
- A new lift-and-project operator (Q1752818) (← links)
- (Q1804362) (redirect page) (← links)
- Computational experience with a difficult mixed-integer multicommodity flow problem (Q1804363) (← links)
- A branch-and-cut algorithm for capacitated network design problems (Q1806022) (← links)
- On a generalization of the master cyclic group polyhedron (Q1960187) (← links)
- Optimal decision trees for categorical data via integer programming (Q2046341) (← links)
- Multilinear sets with two monomials and cardinality constraints (Q2097167) (← links)
- On a generalization of the Chvátal-Gomory closure (Q2118122) (← links)
- Lattice closures of polyhedra (Q2188243) (← links)
- Cardinality constrained multilinear sets (Q2225049) (← links)
- Generalized Chvátal-Gomory closures for integer programs with bounds on variables (Q2235152) (← links)
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming (Q2248762) (← links)
- A note on capacity models for network design (Q2417179) (← links)
- The master equality polyhedron with multiple rows (Q2429471) (← links)
- Valid inequalities based on the interpolation procedure (Q2490327) (← links)
- Valid inequalities based on simple mixed-integer sets (Q2583149) (← links)
- Perspective reformulations of mixed integer nonlinear programs with indicator variables (Q2638370) (← links)
- An integer programming model for the weekly tour scheduling problem (Q2781056) (← links)
- A time bucket formulation for the traveling salesman problem with time windows (Q2815434) (← links)
- Perspective Reformulation and Applications (Q2897294) (← links)
- A Polytope for a Product of Real Linear Functions in 0/1 Variables (Q2897309) (← links)
- Two-step MIR inequalities for mixed integer programs (Q2899057) (← links)
- Computational Experiments with Cross and Crooked Cross Cuts (Q2940067) (← links)
- A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions (Q3115457) (← links)
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables (Q3503836) (← links)
- On Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs (Q3563923) (← links)
- Network design arc set with variable upper bounds (Q3593365) (← links)
- A degree sequence problem related to network design (Q4303623) (← links)
- Reformulating linear programs with transportation constraints-With applications to workforce scheduling (Q4651722) (← links)
- (Q4737516) (← links)
- On Some Generalizations of the Split Closure (Q4910812) (← links)
- On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width (Q4976155) (← links)
- On a Generalization of the Chvátal-Gomory Closure (Q5041739) (← links)