default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimge Küçükyavuz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j42]Linchuan Wei, Alper Atamtürk
, Andrés Gómez, Simge Küçükyavuz:
On the convex hull of convex quadratic optimization problems with indicators. Math. Program. 204(1): 703-737 (2024)- [i9]Tong Xu, Armeen Taeb, Simge Küçükyavuz, Ali Shojaie:
An Asymptotically Optimal Coordinate Descent Algorithm for Learning Bayesian Networks from Gaussian Models. CoRR abs/2408.11977 (2024) - 2023
- [j41]Nam Ho-Nguyen, Fatma Kilinç-Karzan, Simge Küçükyavuz, Dabeen Lee:
Strong Formulations for Distributionally Robust Chance-Constrained Programs with Left-Hand Side Uncertainty Under Wasserstein Ambiguity. INFORMS J. Optim. 5(2): 211-232 (2023) - [j40]Simge Küçükyavuz, Ali Shojaie, Hasan Manzour, Linchuan Wei, Hao-Hsiang Wu:
Consistent Second-Order Conic Integer Programming for Learning Bayesian Networks. J. Mach. Learn. Res. 24: 322:1-322:38 (2023) - [j39]Peijing Liu, Salar Fattahi, Andrés Gómez, Simge Küçükyavuz:
A graph-based decomposition method for convex quadratic optimization with indicators. Math. Program. 200(2): 669-701 (2023) - [j38]Qimeng Yu, Simge Küçükyavuz:
Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints. Math. Program. 201(1): 803-861 (2023) - 2022
- [j37]Simge Küçükyavuz, Ruiwei Jiang:
Chance-constrained optimization under limited distributional information: A review of reformulations based on sampling and distributional robustness. EURO J. Comput. Optim. 10: 100030 (2022) - [j36]Nilay Noyan, Merve Merakli, Simge Küçükyavuz:
Two-stage stochastic programming under multivariate risk constraints with an application to humanitarian relief network design. Math. Program. 191(1): 7-45 (2022) - [j35]Linchuan Wei, Andrés Gómez, Simge Küçükyavuz:
Ideal formulations for constrained convex optimization problems with indicator variables. Math. Program. 192(1): 57-88 (2022) - [j34]Fatma Kilinç-Karzan, Simge Küçükyavuz, Dabeen Lee:
Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens. Math. Program. 195(1): 283-326 (2022) - [j33]Nam Ho-Nguyen, Fatma Kilinç-Karzan, Simge Küçükyavuz, Dabeen Lee:
Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity. Math. Program. 196(1): 641-672 (2022) - [i8]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) - 2021
- [j32]Qimeng Yu, Simge Küçükyavuz:
An exact cutting plane method for k-submodular function maximization. Discret. Optim. 42: 100670 (2021) - [j31]Hasan Manzour, Simge Küçükyavuz, Hao-Hsiang Wu, Ali Shojaie:
Integer Programming for Learning Directed Acyclic Graphs from Continuous Data. INFORMS J. Optim. 3(1): 46-73 (2021) - [j30]Qimeng Yu, Simge Küçükyavuz:
A polyhedral approach to bisubmodular function minimization. Oper. Res. Lett. 49(1): 5-10 (2021) - 2020
- [j29]Merve Merakli, Simge Küçükyavuz:
Risk aversion to parameter uncertainty in Markov decision processes with an application to slow-onset disaster relief. IISE Trans. 52(8): 811-831 (2020) - [j28]Hao-Hsiang Wu, Simge Küçükyavuz:
An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions. Oper. Res. Lett. 48(3): 356-361 (2020) - [c1]Linchuan Wei, Andrés Gómez, Simge Küçükyavuz:
On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables. IPCO 2020: 433-447 - [i7]Qimeng Yu, Simge Küçükyavuz:
A Polyhedral Approach to Bisubmodular Function Minimization. CoRR abs/2003.06036 (2020) - [i6]Simge Küçükyavuz, Ali Shojaie, Hasan Manzour, Linchuan Wei:
Consistent Second-Order Conic Integer Programming for Learning Bayesian Networks. CoRR abs/2005.14346 (2020) - [i5]Linchuan Wei, Andrés Gómez, Simge Küçükyavuz:
Ideal formulations for constrained convex optimization problems with indicator variables. CoRR abs/2007.00107 (2020)
2010 – 2019
- 2019
- [j27]Xiao Liu, Fatma Kilinç-Karzan, Simge Küçükyavuz:
On intersection of two mixing sets with applications to joint chance-constrained programs. Math. Program. 175(1-2): 29-68 (2019) - [j26]Hao-Hsiang Wu, Simge Küçükyavuz:
Probabilistic Partial Set Covering with an Oracle for Chance Constraints. SIAM J. Optim. 29(1): 690-718 (2019) - [i4]Hasan Manzour, Simge Küçükyavuz, Ali Shojaie:
Integer Programming for Learning Directed Acyclic Graphs from Continuous Data. CoRR abs/1904.10574 (2019) - 2018
- [j25]Xiao Liu, Simge Küçükyavuz:
A polyhedral study of the static probabilistic lot-sizing problem. Ann. Oper. Res. 261(1-2): 233-254 (2018) - [j24]Hao-Hsiang Wu, Simge Küçükyavuz:
A two-stage stochastic programming approach for influence maximization in social networks. Comput. Optim. Appl. 69(3): 563-595 (2018) - [j23]Merve Merakli, Simge Küçükyavuz:
Vector-valued multivariate conditional value-at-risk. Oper. Res. Lett. 46(3): 300-305 (2018) - 2017
- [j22]Xiao Liu, Simge Küçükyavuz, Nilay Noyan:
Robust multicriteria risk-averse stochastic programming models. Ann. Oper. Res. 259(1-2): 259-294 (2017) - [j21]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) - [i3]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
- [j20]Xiao Liu, Simge Küçükyavuz, James R. Luedtke:
Decomposition algorithms for two-stage chance-constrained programs. Math. Program. 157(1): 219-243 (2016) - [j19]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) - [j18]Simge Küçükyavuz, Nilay Noyan:
Cut generation for optimization problems with multivariate risk constraints. Math. Program. 159(1-2): 165-199 (2016) - [j17]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) - [j16]Matthias Walter, Pelin Damci-Kurt, Santanu S. Dey, Simge Küçükyavuz:
On a cardinality-constrained transportation problem with market choice. Oper. Res. Lett. 44(2): 170-173 (2016) - 2015
- [j15]Pelin Damci-Kurt, Santanu S. Dey, Simge Küçükyavuz:
On the transportation problem with market choice. Discret. Appl. Math. 181: 54-77 (2015) - [i2]Hao-Hsiang Wu, Simge Küçükyavuz:
Maximizing Influence in Social Networks: A Two-Stage Stochastic Programming Approach That Exploits Submodularity. CoRR abs/1512.04180 (2015) - 2014
- [j14]Yongjia Song, James R. Luedtke, Simge Küçükyavuz:
Chance-Constrained Binary Packing Problems. INFORMS J. Comput. 26(4): 735-747 (2014) - [j13]Minjiao Zhang, Simge Küçükyavuz, Saumya Goel:
A Branch-and-Cut Method for Dynamic Decision Making Under Joint Chance Constraints. Manag. Sci. 60(5): 1317-1333 (2014) - [j12]Dinakar Gade, Simge Küçükyavuz, Suvrajeet Sen:
Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs. Math. Program. 144(1-2): 39-64 (2014) - [j11]Minjiao Zhang, Simge Küçükyavuz:
Finitely Convergent Decomposition Algorithms for Two-Stage Stochastic Pure Integer Programs. SIAM J. Optim. 24(4): 1933-1951 (2014) - [i1]Pelin Damci-Kurt, Santanu S. Dey, Simge Küçükyavuz:
On a Cardinality-Constrained Transportation Problem With Market Choice. CoRR abs/1412.8723 (2014) - 2012
- [j10]Minjiao Zhang, Simge Küçükyavuz, Hande Yaman:
A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands. Oper. Res. 60(4): 918-935 (2012) - [j9]Simge Küçükyavuz:
On mixing sets arising in chance-constrained programming. Math. Program. 132(1-2): 31-56 (2012) - [j8]Binyuan Chen, Simge Küçükyavuz, Suvrajeet Sen:
A computational study of the cutting plane tree algorithm for general mixed-integer linear programs. Oper. Res. Lett. 40(1): 15-19 (2012) - 2011
- [j7]Dinakar Gade, Simge Küçükyavuz:
A Note on "Lot-sizing with fixed charges on stocks: The convex hull". Discret. Optim. 8(2): 385-392 (2011) - [j6]Binyuan Chen, Simge Küçükyavuz, Suvrajeet Sen:
Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs. Oper. Res. 59(1): 202-210 (2011)
2000 – 2009
- 2009
- [j5]Simge Küçükyavuz, Yves Pochet:
Uncapacitated lot sizing with backlogging: the convex hull. Math. Program. 118(1): 151-175 (2009) - 2008
- [j4]April K. Andreas, J. Cole Smith, Simge Küçükyavuz:
Branch-and-price-and-cut algorithms for solving the reliable h -paths problem. J. Glob. Optim. 42(4): 443-466 (2008) - [j3]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) - [j2]Kai Huang, Simge Küçükyavuz:
On stochastic lot-sizing problems with random lead times. Oper. Res. Lett. 36(3): 303-308 (2008) - 2005
- [j1]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)
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-10-07 22:14 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:
