# Simge Küçükyavuz

According to our database

Collaborative distances:

^{1}, Simge Küçükyavuz authored at least 34 papers between 2005 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

Ideal formulations for constrained convex optimization problems with indicator variables.

CoRR, 2020

CoRR, 2020

CoRR, 2020

On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables.

Proceedings of the Integer Programming and Combinatorial Optimization, 2020

2019

SIAM J. Optim., 2019

On intersection of two mixing sets with applications to joint chance-constrained programs.

Math. Program., 2019

CoRR, 2019

2018

Oper. Res. Lett., 2018

A two-stage stochastic programming approach for influence maximization in social networks.

Comput. Optim. Appl., 2018

Annals OR, 2018

2017

Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem.

SIAM J. Optim., 2017

Annals OR, 2017

2016

Oper. Res. Lett., 2016

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

Networks, 2016

Math. Program., 2016

Math. Program., 2016

Math. Program., 2016

2015

Discret. Appl. Math., 2015

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

CoRR, 2015

2014

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

INFORMS J. Comput., 2014

CoRR, 2014

2012

A computational study of the cutting plane tree algorithm for general mixed-integer linear programs.

Oper. Res. Lett., 2012

Math. Program., 2012

Oper. Res., 2012

2011

Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs.

Oper. Res., 2011

Discret. Optim., 2011

2009

Math. Program., 2009

2008

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

2005

Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation.

Oper. Res., 2005