 | 2012 |
| 28 |  | Alper Atamtürk,
Kiavash Kianfar:
n-step mingling inequalities: new facets for the mixed-integer knapsack set.
Math. Program. 132(1-2): 79-98 (2012) |
| 2011 |
| 27 |  | Alper Atamtürk,
Vishnu Narayanan:
Lifting for conic mixed-integer programming.
Math. Program. 126(2): 351-363 (2011) |
| 26 |  | Shabbir Ahmed,
Alper Atamtürk:
Maximizing a class of submodular utility functions.
Math. Program. 128(1-2): 149-169 (2011) |
| 2010 |
| 25 |  | M. Selim Aktürk,
Alper Atamtürk,
Sinan Gürel:
Parallel machine match-up scheduling with manufacturing cost considerations.
J. Scheduling 13(1): 95-110 (2010) |
| 24 |  | Alper Atamtürk,
Vishnu Narayanan:
Conic mixed-integer rounding cuts.
Math. Program. 122(1): 1-20 (2010) |
| 23 |  | Alper Atamtürk,
Oktay Günlük:
Mingling: mixed-integer rounding with bounds.
Math. Program. 123(2): 315-338 (2010) |
| 2009 |
| 22 |  | Alper Atamtürk,
Vishnu Narayanan:
The submodular knapsack polytope.
Discrete Optimization 6(4): 333-344 (2009) |
| 21 |  | M. Selim Akturk,
Alper Atamtürk,
Sinan Gurel:
A strong conic quadratic reformulation for machine-job assignment with controllable processing times.
Oper. Res. Lett. 37(3): 187-191 (2009) |
| 2008 |
| 20 |  | Alper Atamtürk,
Deepak Rajan:
Partition inequalities for capacitated survivable network design based on directed p-cycles.
Discrete Optimization 5(2): 415-433 (2008) |
| 19 |  | Alper Atamtürk,
Muhong Zhang:
The Flow Set with Partial Order.
Math. Oper. Res. 33(3): 730-746 (2008) |
| 18 |  | Alper 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) |
| 17 |  | Alper Atamtürk,
Vishnu Narayanan:
Polymatroids and mean-risk minimization in discrete optimization.
Oper. Res. Lett. 36(5): 618-622 (2008) |
| 2007 |
| 16 |  | Alper Atamtürk,
Vishnu Narayanan:
Cuts for Conic Mixed-Integer Programming.
IPCO 2007: 16-29 |
| 15 |  | Alper Atamtürk,
Oktay Günlük:
Network design arc set with variable upper bounds.
Networks 50(1): 17-28 (2007) |
| 14 |  | Alper Atamtürk,
Muhong Zhang:
Two-Stage Robust Network Flow and Design Under Demand Uncertainty.
Operations Research 55(4): 662-673 (2007) |
| 2006 |
| 13 |  | Alper Atamtürk:
Strong Formulations of Robust Mixed 0-1 Programming.
Math. Program. 108(2-3): 235-250 (2006) |
| 2005 |
| 12 |  | Alper Atamtürk:
Cover and Pack Inequalities for (Mixed) Integer Programming.
Annals OR 139(1): 21-38 (2005) |
| 11 |  | Alper Atamtürk,
Martin W. P. Savelsbergh:
Integer-Programming Software Systems.
Annals OR 140(1): 67-124 (2005) |
| 10 |  | Alper Atamtürk,
Simge Küçükyavuz:
Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation.
Operations Research 53(4): 711-730 (2005) |
| 2004 |
| 9 |  | Alper Atamtürk,
Juan Carlos Muñoz:
A study of the lot-sizing polytope.
Math. Program. 99(3): 443-465 (2004) |
| 8 |  | Deepak Rajan,
Alper Atamtürk:
A directed cycle-based column-and-cut generation method for capacitated survivable network design.
Networks 43(4): 201-211 (2004) |
| 7 |  | Alper Atamtürk:
Sequence Independent Lifting for Mixed-Integer Programming.
Operations Research 52(3): 487-490 (2004) |
| 2003 |
| 6 |  | Alper Atamtürk:
On the facets of the mixed-integer knapsack polyhedron.
Math. Program. 98(1-3): 145-175 (2003) |
| 2002 |
| 5 |  | Alper Atamtürk,
Deepak Rajan:
On splittable and unsplittable flow capacitated network design arc-set polyhedra.
Math. Program. 92(2): 315-333 (2002) |
| 4 |  | Alper Atamtürk:
On capacitated network design cut-set polyhedra.
Math. Program. 92(3): 425-437 (2002) |
| 2001 |
| 3 |  | Alper Atamtürk:
Flow pack facets of the single node fixed-charge flow polytope.
Oper. Res. Lett. 29(3): 107-114 (2001) |
| 2000 |
| 2 |  | Alper Atamtürk,
George L. Nemhauser,
Martin W. P. Savelsbergh:
Conflict graphs in solving integer programming problems.
European Journal of Operational Research 121(1): 40-55 (2000) |
| 1999 |
| 1 |  | Alper Atamtürk,
George L. Nemhauser,
Martin W. P. Savelsbergh:
Valid Inequalities for Problems with Additive Variable Upper Bounds.
IPCO 1999: 60-72 |