Oktay Gunluk

Research Staff Member

Optimization Center
Mathematical Sciences Department

Research lab: Watson Research Center (Yorktown)

Oktay Günlük
IBM T.J. Watson Research Center
P.O. Box 218
Yorktown Heights, NY 10598
TEL: (914) 945-1087
FAX: (914) 945-3434
gunluk(at)us.ibm.com

Bio:

I did my undergraduate and M.S. at Bogazici University, Dept. of IE.
I received my Ph.D. from Columbia University, Dept. of IEOR where I worked with Dan Bienstock.
After Columbia, I spent a year at CORE (Belgium) as a postdoctoral fellow and two years at Cornell University, School of ORIE as a visiting scientist.
Before joining the Math Sciences Department at IBM, I was working at AT&T Labs.

---

Research Interests:

Mixed-integer programming, combinatorial optimization, multicommodity flows.
Modeling, optimization and computation, especially applied to logistics, routing, workforce scheduling and network design.

---

Publications:

1. On mixing inequalities: rank, closure and cutting plane proofs, with Dash, submitted (2008).
2. Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables, with Linderoth, submitted (2008). (a shorter version appeared in IPCO 2008).
3. Mingling: Mixed-Integer Rounding with Bounds , with Atamturk, to appear in Math. Programming.
4. MINLP Strengthening for Separable Convex Quadratic Transportation-Cost UFL, with Lee and Weismantel, IBM technical report (2007).
5. MIR Closures of Polyhedral Sets, with Dash and Lodi, to appear in Math. Programming. (a shorter version appeared in IPCO 2007).
6. On a Generalization of the Master Cyclic Group Polyhedron, with Dash and Fukasawa, to appear in Math. Programming. (a shorter version appeared in IPCO 2007).
7. On the strength of Gomory mixed-integer cuts as group cuts, with Dash, Math. Programming, 115, 387-407 (2008).
8. Two step MIR inequalities for mixed-integer programs, with Dash and Goycoolea, submitted (2006).
9. A pricing problem under Monge property, Discrete Optimization 5, 328-336, 2008.
10. Network Design Arc Set with Variable Upper Bounds, with Atamturk, Networks 50, 17-28, 2007.
11. Vehicle Routing and Staffing for Sedan Service, with Kimbrel, Ladanyi, Schieber and Sorkin, Transportation Science, 40, 313-326 (2006).
12. Valid Inequalities Based on the Interpolation Procedure, with Dash, Math. Programming, 106, 111-136 (2006).
13. A Polytope for a Product of Real Linear Functions in 0/1 Variables, with Coppersmith, Lee and Leung, IBM technical report, (2003).
14. Valid Inequalities Based on Simple Mixed-integer Sets, with Dash, Math. Programming, 105, 29-53 (2006). (a shorter version appeared in IPCO 2004).
15. A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions, with Ladanyi and de Vries, Management Science, 51, 391--406 (2005).
16. Reformulating LPs with Transport. Const. -- App. to Workforce Scheduling, with Cezik, Naval Research Logistics, 51, 258--274 (2004).
17. Robust Capacity Planning in Semiconductor Manufacturing, with Barahona, Bermon and Hood, Naval Research Logistics, 51, 258--274 (2004).
18. A New Min-Cut Max-Flow Ratio for Multicommodity Flows, SIAM J. of Disc. Math., 21, pp. 1--15 (2007) (a shorter version appeared in IPCO 2002).
19. Mixing Mixed-Integer Inequalities, with Pochet, Math. Programming, 90, 429-457 (2001).
20. An Integer Programming Model for the Weekly Tour Scheduling Problem, with Cezik and Luss, Naval Research Logistics, 48, 607--624 (2001).
21. A Branch-and-Cut Algorithm for Capacitated Network Design Problems, Math. Programming, 86, 17-39 (1999).
22. The Multicast Packing Problem, with Chen and Yener, IEEE Transactions on Networking, 8, 311-318 (2000).
23. Designing Private Line Networks - Polyhedral Analysis and Computation, with Brockmuller and Wolsey, CORE - DP 96-47. ( a shorter version appeared in Transactions on Operational Research, 16, 7-24 (2004))
24. Optimal Packing of Group Multicasting, with Chen and Yener, Proceedings, IEEE Infocom 1998.
25. Minimum Cost Capacity Installation for Multicommodity Network Flows, with Bienstock, Chopra and Tsai, Math. Programming, 81, 177-199 (1998).
26. Capacitated Network Design - Polyhedral Structure and Computation, with Bienstock, INFORMS Journal on Computing, 8, 243-259, (1996). (pdf)
27. Computational Experience with a Difficult Multicommodity Flow Problem, with Bienstock, Math. Programming, 68, 213-238 (1995).
28. A Degree Sequence Problem Related to Network Design, with Bienstock, Networks, 24, 195-205 (1994).
29. Maintenance of a Device with Age-Dependent Exponential Failures, with Ozekici, Naval Research Logistics, 39, 699-714 (1992).
    

Co-authors: Alper Atamturk, Francisco Barahona, Stuart Bermon, Dan Bienstock, Beate Brockmuller,Tolga Cezik, Shiwen Chen, Sunil Chopra, Don Coppersmith, Sanjeeb Dash, Ricardo Fukasawa, Marcos Goycoolea, Sarah Hood, Tracy Kimbrel, Laci Ladanyi, Jon Lee, Janny Leung, Jeff Linderoth , Andrea Lodi, Hanan Luss, Suleyman Ozekici, Yves Pochet, Baruch Schieber, Gregory Sorkin, Chih-Yang Tsai, Sven de Vries, Bulent Yener, Laurence Wolsey, Robert Weismantel

---

Read more


Last updated 6 Oct 2008