2008 |
15 | EE | Oktay Günlük,
Jeff Linderoth:
Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables.
IPCO 2008: 1-16 |
14 | EE | Oktay Günlük:
A pricing problem under Monge property.
Discrete Optimization 5(2): 328-336 (2008) |
13 | EE | Sanjeeb Dash,
Oktay Günlük:
On the strength of Gomory mixed-integer cuts as group cuts.
Math. Program. 115(2): 387-407 (2008) |
2007 |
12 | EE | Sanjeeb Dash,
Ricardo Fukasawa,
Oktay Günlük:
On a Generalization of the Master Cyclic Group Polyhedron.
IPCO 2007: 197-209 |
11 | EE | Sanjeeb Dash,
Oktay Günlük,
Andrea Lodi:
On the MIR Closure of Polyhedra.
IPCO 2007: 337-351 |
10 | EE | Alper Atamtürk,
Oktay Günlük:
Network design arc set with variable upper bounds.
Networks 50(1): 17-28 (2007) |
9 | EE | Oktay Günlük:
A New Min-Cut Max-Flow Ratio for Multicommodity Flows.
SIAM J. Discrete Math. 21(1): 1-15 (2007) |
2006 |
8 | EE | Sanjeeb Dash,
Oktay Günlük:
Valid inequalities based on simple mixed-integer sets.
Math. Program. 105(1): 29-53 (2006) |
7 | EE | Sanjeeb Dash,
Oktay Günlük:
Valid inequalities based on the interpolation procedure.
Math. Program. 106(1): 111-136 (2006) |
2004 |
6 | EE | Sanjeeb Dash,
Oktay Günlük:
Valid Inequalities Based on Simple Mixed-Integer Sets.
IPCO 2004: 33-45 |
2002 |
5 | EE | Oktay Günlük:
A New Min-Cut Max-Flow Ratio for Multicommodity Flows.
IPCO 2002: 54-66 |
2000 |
4 | EE | Shiwen Chen,
Oktay Günlük,
Bülent Yener:
The multicast packing problem.
IEEE/ACM Trans. Netw. 8(3): 311-318 (2000) |
1998 |
3 | | Shiwen Chen,
Oktay Günlük,
Bülent Yener:
Optimal Packing of Group Multi-Casting.
INFOCOM 1998: 980-987 |
2 | | Daniel Bienstock,
Sunil Chopra,
Oktay Günlük,
Chih-Yang Tsai:
Minimum cost capacity installation for multicommodity network flows.
Math. Program. 81: 177-199 (1998) |
1995 |
1 | | Daniel Bienstock,
Oktay Günlük:
Computational experience with a difficult mixed-integer multicommodity flow problem.
Math. Program. 68: 213-237 (1995) |