Simge Kucukyavuz

Professor

Northwestern University

United States

Research Interests

Explore related searches

Professors in United States

Contact this professor

Get a free first email built on one of their papers, ready for you to edit and send yourself.

About

Simge Kucukyavuz is a Professor at Northwestern University in the United States. Her research focuses on quadratic optimization, resource allocation in networks, and mixed-integer programming. She has authored several recent articles highlighting advancements in convex optimization, submodular minimization, and chance-constrained programs.

Articles (14)

Year:

2025

Year:

2025

Year:

2024

Year:

2024

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2022

Year:

2021

Year:

2021

Year:

2021

Year:

2021

Collaborators (2)

Nam Ho-Nguyen

Lecturer

University of Sydney

AUSTRALIA

View details

Andres Gomez

University of Pittsburgh

UNITED STATES

View details

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Simge Kucukyavuz

Research Interests

Explore related searches

Contact this professor

About

Articles (14)

Polyhedral analysis of quadratic optimization problems with Stieltjes matrices and indicators

A parametric approach for solving convex quadratic optimization with indicators over trees

Dynamic Allocation of Reusable Resources: Logarithmic Regret in Overloaded Networks

On Constrained Mixed-Integer DR-Submodular Minimization

A graph-based decomposition method for convex quadratic optimization with indicators

On the convex hull of convex quadratic optimization problems with indicators

Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints

Conic Mixed-Binary Sets: Convex Hull Characterizations and Applications

Strong Formulations for Distributionally Robust Chance-Constrained Programs with Left-Hand Side Uncertainty Under Wasserstein Ambiguity

Chance-constrained optimization under limited distributional information: A review of reformulations based on sampling and distributional robustness

An exact cutting plane method for k-submodular function maximization

Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens

Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity

A polyhedral approach to bisubmodular function minimization

Collaborators (2)

Nam Ho-Nguyen

Andres Gomez

Make your next move.