default search action
Alper Atamtürk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j57]Linchuan Wei, Alper Atamtürk
, Andrés Gómez
On the convex hull of convex quadratic optimization problems with indicators. Math. Program. 204(1): 703-737 (2024) - 2023
- [j56]Alper Atamtürk
Supermodularity and valid inequalities for quadratic optimization with indicators. Math. Program. 201(1): 295-338 (2023) - [j55]Shaoning Han
$\mathbf {2\times 2}$-Convexifications for convex quadratic optimization with indicator variables. Math. Program. 202(1): 95-134 (2023) - [j54]Meng Li, Paul Grigas
On the softplus penalty for large-scale convex optimization. Oper. Res. Lett. 51(6): 666-672 (2023) - 2022
- [j53]Alper Atamtürk
Submodular function minimization and polarity. Math. Program. 196(1): 57-67 (2022) - [j52]Shaoning Han
The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables. Oper. Res. Lett. 50(2): 195-198 (2022) - [c8]Anna Deza, Alper Atamtürk:
Safe Screening for Logistic Regression with ℓ -ℓ Regularization. KDIR 2022: 119-126 - [i12]Linchuan Wei, Alper Atamtürk, Andrés Gómez, Simge Küçükyavuz:
On the convex hull of convex quadratic optimization problems with indicators. CoRR abs/2201.00387 (2022) - [i11]Anna Deza, Alper Atamtürk:
Safe Screening for Logistic Regression with 𝓁0-𝓁2 Regularization. CoRR abs/2202.00467 (2022) - [i10]Ramtin Madani, Mersedeh Ashraphijuo, Mohsen Kheirandishfard, Alper Atamtürk:
Parabolic Relaxation for Quadratically-constrained Quadratic Programming - Part I: Definitions & Basic Properties. CoRR abs/2208.03622 (2022) - [i9]Ramtin Madani, Mersedeh Ashraphijuo, Mohsen Kheirandishfard, Alper Atamtürk:
Parabolic Relaxation for Quadratically-constrained Quadratic Programming - Part II: Theoretical & Computational Results. CoRR abs/2208.03625 (2022) - [i8]Alicia Y. Tsai, Juliette Decugis, Laurent El Ghaoui, Alper Atamtürk:
State-driven Implicit Modeling for Sparsity and Robustness in Neural Networks. CoRR abs/2209.09389 (2022) - 2021
- [j51]Alper Atamtürk, Andrés Gómez, Shaoning Han:
Sparse and Smooth Signal Estimation: Convexification of L0-Formulations. J. Mach. Learn. Res. 22: 52:1-52:43 (2021) - [i7]Tuncay Altun, Ramtin Madani, Alper Atamtürk, Ross Baldick, Ali Davoudi:
Enhanced Modeling of Contingency Response in Security-constrained Optimal Power Flow. CoRR abs/2102.08579 (2021) - 2020
- [j50]Alper Atamtürk
Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction. INFORMS J. Comput. 32(2): 346-355 (2020) - [j49]Alper Atamtürk
Submodularity in Conic Quadratic Mixed 0-1 Optimization. Oper. Res. 68(2): 609-630 (2020) - [j48]Ramtin Madani, Mohsen Kheirandishfard, Javad Lavaei, Alper Atamtürk
Penalized semidefinite programming for quadratically-constrained quadratic optimization. J. Glob. Optim. 78(3): 423-451 (2020) - [c7]Alper Atamtürk, Andrés Gómez:
Safe screening rules for L0-regression from Perspective Relaxations. ICML 2020: 421-430 - [i6]Alper Atamtürk, Andrés Gómez:
Safe Screening Rules for 𝓁0-Regression. CoRR abs/2004.08773 (2020) - [i5]Alper Atamtürk, Andrés Gómez:
Supermodularity and valid inequalities for quadratic optimization with indicators. CoRR abs/2012.14633 (2020)
2010 – 2019
- 2019
- [j47]Alper Atamtürk
Lifted polymatroid inequalities for mean-risk optimization with indicator variables. J. Glob. Optim. 73(4): 677-699 (2019) - [j46]Alper Atamtürk, Andrés Gómez:
Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra. Math. Program. Comput. 11(2): 311-340 (2019) - [i4]Alper Atamtürk, Andrés Gómez:
Rank-one Convexification for Sparse Regression. CoRR abs/1901.10334 (2019) - [i3]Alper Atamtürk, Vishnu Narayanan:
Submodular Function Minimization and Polarity. CoRR abs/1912.13238 (2019) - 2018
- [j45]Alper Sen
Technical Note - A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model. Oper. Res. 66(4): 994-1003 (2018) - [j44]Alper Atamtürk
Strong formulations for quadratic optimization with M-matrices and indicator variables. Math. Program. 170(1): 141-176 (2018) - [j43]Alper Atamtürk, Avinash Bhardwaj
Network design with probabilistic capacities. Networks 71(1): 16-30 (2018) - [j42]Alper Atamtürk, Oktay Günlük
A note on capacity models for network design. Oper. Res. Lett. 46(4): 414-417 (2018) - [i2]Alper Atamtürk, Andrés Gómez, Shaoning Han:
Sparse and Smooth Signal Estimation: Convexification of L0 Formulations. CoRR abs/1811.02655 (2018) - 2017
- [j41]Alper Atamtürk, Sam Burer:
Editorial. Discret. Optim. 24: 1-2 (2017) - [j40]Alper Atamtürk, Andrés Gómez:
Maximizing a Class of Utility Functions Over the Vertices of a Polytope. Oper. Res. 65(2): 433-445 (2017) - [j39]Chen Chen
A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables. Math. Program. 165(2): 549-577 (2017) - [j38]Alper Atamtürk, Simge Küçükyavuz, Birce Tezel:
Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem. SIAM J. Optim. 27(3): 1943-1976 (2017) - [c6]Salar Fattahi, Javad Lavaei, Alper Atamtürk:
Promises of conic relaxations in optimal transmission switching of power systems. CDC 2017: 3238-3245 - [c5]Ramtin Madani, Javad Lavaei, Ross Baldick, Alper Atamtürk:
Power System State Estimation and Bad Data Detection by Means of Conic Relaxation. HICSS 2017: 1-10 - [i1]Alper Atamtürk, Birce Tezel, Simge Küçükyavuz:
Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem. CoRR abs/1705.05920 (2017) - 2016
- [j37]Pelin Damci-Kurt, Simge Küçükyavuz, Deepak Rajan, Alper Atamtürk:
A polyhedral study of production ramping. Math. Program. 158(1-2): 175-205 (2016) - [j36]Alper Atamtürk, Andrés Gómez, Simge Küçükyavuz:
Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems. Networks 67(4): 299-315 (2016) - [c4]Morteza Ashraphijuo, Salar Fattahi, Javad Lavaei, Alper Atamtürk:
A strong semidefinite programming relaxation of the unit commitment problem. CDC 2016: 694-701 - 2015
- [j35]Alper Atamtürk, Avinash Bhardwaj
Supermodular covering knapsack polytope. Discret. Optim. 18: 74-86 (2015) - 2014
- [j34]M. Selim Aktürk
Aircraft Rescheduling with Cruise Speed Control. Oper. Res. 62(4): 829-845 (2014) - [c3]Animesh Garg, Timmy Siauw, Guang Yang, Sachin Patil, J. Adam M. Cunha, I-Chow Hsu, Jean Pouliot, Alper Atamtürk, Kenneth Y. Goldberg
Exact reachability analysis for planning skew-line needle arrangements for automated brachytherapy. CASE 2014: 524-531 - 2013
- [j33]Alper Atamtürk, Laurent Flindt Muller, David Pisinger
Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds. INFORMS J. Comput. 25(3): 420-431 (2013) - 2012
- [j32]Alper Atamtürk, Gemma Berenguer
A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems. Oper. Res. 60(2): 366-381 (2012) - [j31]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
- [j30]Alper Atamtürk, Vishnu Narayanan:
Lifting for conic mixed-integer programming. Math. Program. 126(2): 351-363 (2011) - [j29]Shabbir Ahmed
Maximizing a class of submodular utility functions. Math. Program. 128(1-2): 149-169 (2011) - 2010
- [j28]Alper Atamtürk, Vishnu Narayanan:
Conic mixed-integer rounding cuts. Math. Program. 122(1): 1-20 (2010) - [j27]Alper Atamtürk, Oktay Günlük
Mingling: mixed-integer rounding with bounds. Math. Program. 123(2): 315-338 (2010) - [j26]M. Selim Aktürk
Parallel machine match-up scheduling with manufacturing cost considerations. J. Sched. 13(1): 95-110 (2010)
2000 – 2009
- 2009
- [j25]Alper Atamtürk, Vishnu Narayanan:
The submodular knapsack polytope. Discret. Optim. 6(4): 333-344 (2009) - [j24]M. Selim Akturk
A strong conic quadratic reformulation for machine-job assignment with controllable processing times. Oper. Res. Lett. 37(3): 187-191 (2009) - 2008
- [j23]Alper Atamtürk, Deepak Rajan:
Partition inequalities for capacitated survivable network design based on directed p-cycles. Discret. Optim. 5(2): 415-433 (2008) - [j22]Alper Atamtürk, Muhong Zhang:
The Flow Set with Partial Order. Math. Oper. Res. 33(3): 730-746 (2008) - [j21]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) - [j20]Alper Atamtürk, Vishnu Narayanan:
Polymatroids and mean-risk minimization in discrete optimization. Oper. Res. Lett. 36(5): 618-622 (2008) - 2007
- [j19]Alper Atamtürk, Muhong Zhang:
Two-Stage Robust Network Flow and Design Under Demand Uncertainty. Oper. Res. 55(4): 662-673 (2007) - [j18]Alper Atamtürk, Oktay Günlük
Network design arc set with variable upper bounds. Networks 50(1): 17-28 (2007) - [c2]Alper Atamtürk, Vishnu Narayanan:
Cuts for Conic Mixed-Integer Programming. IPCO 2007: 16-29 - 2006
- [j17]Alper Atamtürk:
Strong Formulations of Robust Mixed 0-1 Programming. Math. Program. 108(2-3): 235-250 (2006) - 2005
- [j16]Alper Atamtürk:
Cover and Pack Inequalities for (Mixed) Integer Programming. Ann. Oper. Res. 139(1): 21-38 (2005) - [j15]Alper Atamtürk, Martin W. P. Savelsbergh
Integer-Programming Software Systems. Ann. Oper. Res. 140(1): 67-124 (2005) - [j14]Alper Atamtürk, Simge Küçükyavuz:
Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation. Oper. Res. 53(4): 711-730 (2005) - 2004
- [j13]Alper Atamtürk:
Sequence Independent Lifting for Mixed-Integer Programming. Oper. Res. 52(3): 487-490 (2004) - [j12]Alper Atamtürk, Juan Carlos Muñoz:
A study of the lot-sizing polytope. Math. Program. 99(3): 443-465 (2004) - [j11]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) - 2003
- [j10]Alper Atamtürk:
On the facets of the mixed-integer knapsack polyhedron. Math. Program. 98(1-3): 145-175 (2003) - 2002
- [j9]Alper Atamtürk, Deepak Rajan:
On splittable and unsplittable flow capacitated network design arc-set polyhedra. Math. Program. 92(2): 315-333 (2002) - [j8]Alper Atamtürk:
On capacitated network design cut-set polyhedra. Math. Program. 92(3): 425-437 (2002) - 2001
- [j7]Alper Atamtürk, Dorit S. Hochbaum:
Capacity Acquisition, Subcontracting, and Lot Sizing. Manag. Sci. 47(8): 1081-1100 (2001) - [j6]Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh:
Valid inequalities for problems with additive variable upper bounds. Math. Program. 91(1): 145-162 (2001) - [j5]Alper Atamtürk:
Flow pack facets of the single node fixed-charge flow polytope. Oper. Res. Lett. 29(3): 107-114 (2001) - 2000
- [j4]Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh
Conflict graphs in solving integer programming problems. Eur. J. Oper. Res. 121(1): 40-55 (2000) - [j3]Alper Atamtürk, Ellis L. Johnson, Jeff T. Linderoth, Martin W. P. Savelsbergh:
A Relational Modeling System for Linear and Integer Programming. Oper. Res. 48(6): 846-857 (2000) - [j2]Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh:
The mixed vertex packing problem. Math. Program. 89(1): 35-53 (2000)
1990 – 1999
- 1999
- [c1]Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh:
Valid Inequalities for Problems with Additive Variable Upper Bounds. IPCO 1999: 60-72 - 1996
- [j1]Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh:
A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems. J. Heuristics 1(2): 247-259 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: