dblp.uni-trier.dewww.uni-trier.de

Oktay Günlük Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2008
17EEOktay Günlük, Jeff Linderoth: Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables. IPCO 2008: 1-16
16EEOktay Günlük: A pricing problem under Monge property. Discrete Optimization 5(2): 328-336 (2008)
15EESanjeeb Dash, Oktay Günlük: On the strength of Gomory mixed-integer cuts as group cuts. Math. Program. 115(2): 387-407 (2008)
2007
14EESanjeeb Dash, Ricardo Fukasawa, Oktay Günlük: On a Generalization of the Master Cyclic Group Polyhedron. IPCO 2007: 197-209
13EESanjeeb Dash, Oktay Günlük, Andrea Lodi: On the MIR Closure of Polyhedra. IPCO 2007: 337-351
12EEAlper Atamtürk, Oktay Günlük: Network design arc set with variable upper bounds. Networks 50(1): 17-28 (2007)
11EEOktay Günlük: A New Min-Cut Max-Flow Ratio for Multicommodity Flows. SIAM J. Discrete Math. 21(1): 1-15 (2007)
2006
10EESanjeeb Dash, Oktay Günlük: Valid inequalities based on simple mixed-integer sets. Math. Program. 105(1): 29-53 (2006)
9EESanjeeb Dash, Oktay Günlük: Valid inequalities based on the interpolation procedure. Math. Program. 106(1): 111-136 (2006)
8EEOktay Günlük, Tracy Kimbrel, Laszlo Ladányi, Baruch Schieber, Gregory B. Sorkin: Vehicle Routing and Staffing for Sedan Service. Transportation Science 40(3): 313-326 (2006)
2004
7EESanjeeb Dash, Oktay Günlük: Valid Inequalities Based on Simple Mixed-Integer Sets. IPCO 2004: 33-45
2002
6EEOktay Günlük: A New Min-Cut Max-Flow Ratio for Multicommodity Flows. IPCO 2002: 54-66
2000
5EEShiwen Chen, Oktay Günlük, Bülent Yener: The multicast packing problem. IEEE/ACM Trans. Netw. 8(3): 311-318 (2000)
1998
4 Shiwen Chen, Oktay Günlük, Bülent Yener: Optimal Packing of Group Multi-Casting. INFOCOM 1998: 980-987
3 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)
1996
2EEDaniel Bienstock, Oktay Günlük: Capacitated Network Design - Polyhedral Structure and Computation. INFORMS Journal on Computing 8(3): 243-259 (1996)
1995
1 Daniel Bienstock, Oktay Günlük: Computational experience with a difficult mixed-integer multicommodity flow problem. Math. Program. 68: 213-237 (1995)

Coauthor Index

1Alper Atamtürk [12]
2Daniel Bienstock [1] [2] [3]
3Shiwen Chen [4] [5]
4Sunil Chopra [3]
5Sanjeeb Dash [7] [9] [10] [13] [14] [15]
6Ricardo Fukasawa [14]
7Tracy Kimbrel [8]
8Laszlo Ladányi [8]
9Jeff T. Linderoth (Jeff Linderoth) [17]
10Andrea Lodi [13]
11Baruch Schieber [8]
12Gregory B. Sorkin [8]
13Chih-Yang Tsai [3]
14Bülent Yener [4] [5]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)