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

Alper Atamtürk

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

2008
12EEAlper Atamtürk, Deepak Rajan: Partition inequalities for capacitated survivable network design based on directed p-cycles. Discrete Optimization 5(2): 415-433 (2008)
11EEAlper Atamtürk, Simge Küçükyavuz: An O(n2) algorithm for lot sizing with inventory bounds and fixed costs. Oper. Res. Lett. 36(3): 297-299 (2008)
10EEAlper Atamtürk, Vishnu Narayanan: Polymatroids and mean-risk minimization in discrete optimization. Oper. Res. Lett. 36(5): 618-622 (2008)
2007
9EEAlper Atamtürk, Vishnu Narayanan: Cuts for Conic Mixed-Integer Programming. IPCO 2007: 16-29
8EEAlper Atamtürk, Oktay Günlük: Network design arc set with variable upper bounds. Networks 50(1): 17-28 (2007)
2006
7EEAlper Atamtürk: Strong Formulations of Robust Mixed 0-1 Programming. Math. Program. 108(2-3): 235-250 (2006)
2005
6EEAlper Atamtürk: Cover and Pack Inequalities for (Mixed) Integer Programming. Annals OR 139(1): 21-38 (2005)
5EEAlper Atamtürk, Martin W. P. Savelsbergh: Integer-Programming Software Systems. Annals OR 140(1): 67-124 (2005)
2004
4EEAlper Atamtürk, Juan Carlos Muñoz: A study of the lot-sizing polytope. Math. Program. 99(3): 443-465 (2004)
3EEDeepak Rajan, Alper Atamtürk: A directed cycle-based column-and-cut generation method for capacitated survivable network design. Networks 43(4): 201-211 (2004)
2001
2EEAlper Atamtürk: Flow pack facets of the single node fixed-charge flow polytope. Oper. Res. Lett. 29(3): 107-114 (2001)
1999
1EEAlper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh: Valid Inequalities for Problems with Additive Variable Upper Bounds. IPCO 1999: 60-72

Coauthor Index

1Oktay Günlük [8]
2Simge Küçükyavuz [11]
3Juan Carlos Muñoz [4]
4Vishnu Narayanan [9] [10]
5George L. Nemhauser [1]
6Deepak Rajan [3] [12]
7Martin W. P. Savelsbergh [1] [5]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)