Simge Küçükyavuz

According to our database1, Simge Küçükyavuz authored at least 34 papers between 2005 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.



In proceedings 
PhD thesis 




Ideal formulations for constrained convex optimization problems with indicator variables.
CoRR, 2020

Consistent Second-Order Conic Integer Programming for Learning Bayesian Networks.
CoRR, 2020

A Polyhedral Approach to Bisubmodular Function Minimization.
CoRR, 2020

On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables.
Proceedings of the Integer Programming and Combinatorial Optimization, 2020

Probabilistic Partial Set Covering with an Oracle for Chance Constraints.
SIAM J. Optim., 2019

On intersection of two mixing sets with applications to joint chance-constrained programs.
Math. Program., 2019

Integer Programming for Learning Directed Acyclic Graphs from Continuous Data.
CoRR, 2019

Vector-valued multivariate conditional value-at-risk.
Oper. Res. Lett., 2018

A two-stage stochastic programming approach for influence maximization in social networks.
Comput. Optim. Appl., 2018

A polyhedral study of the static probabilistic lot-sizing problem.
Annals OR, 2018

Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem.
SIAM J. Optim., 2017

Robust multicriteria risk-averse stochastic programming models.
Annals OR, 2017

On a cardinality-constrained transportation problem with market choice.
Oper. Res. Lett., 2016

Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems.
Networks, 2016

Decomposition algorithms for two-stage chance-constrained programs.
Math. Program., 2016

Cut generation for optimization problems with multivariate risk constraints.
Math. Program., 2016

A polyhedral study of production ramping.
Math. Program., 2016

On the transportation problem with market choice.
Discret. Appl. Math., 2015

Maximizing Influence in Social Networks: A Two-Stage Stochastic Programming Approach That Exploits Submodularity.
CoRR, 2015

Finitely Convergent Decomposition Algorithms for Two-Stage Stochastic Pure Integer Programs.
SIAM J. Optim., 2014

Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs.
Math. Program., 2014

A Branch-and-Cut Method for Dynamic Decision Making Under Joint Chance Constraints.
Manag. Sci., 2014

Chance-Constrained Binary Packing Problems.
INFORMS J. Comput., 2014

On a Cardinality-Constrained Transportation Problem With Market Choice.
CoRR, 2014

A computational study of the cutting plane tree algorithm for general mixed-integer linear programs.
Oper. Res. Lett., 2012

On mixing sets arising in chance-constrained programming.
Math. Program., 2012

A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands.
Oper. Res., 2012

Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs.
Oper. Res., 2011

A Note on "Lot-sizing with fixed charges on stocks: The convex hull".
Discret. Optim., 2011

Uncapacitated lot sizing with backlogging: the convex hull.
Math. Program., 2009

On stochastic lot-sizing problems with random lead times.
Oper. Res. Lett., 2008

An O(n<sup>2</sup>) algorithm for lot sizing with inventory bounds and fixed costs.
Oper. Res. Lett., 2008

Branch-and-price-and-cut algorithms for solving the reliable <i>h</i> -paths problem.
J. Global Optimization, 2008

Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation.
Oper. Res., 2005