Simge Küçükyavuz

Math. Program., 2023

2022

Ideal formulations for constrained convex optimization problems with indicator variables.

[BibT_eX]

[DOI]

Linchuan Wei

Andrés Gómez

Math. Program., 2022

Two-stage stochastic programming under multivariate risk constraints with an application to humanitarian relief network design.

[BibT_eX]

[DOI]

Nilay Noyan

Merve Merakli

Math. Program., 2022

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

[BibT_eX]

[DOI]

Fatma Kilinç-Karzan

Dabeen Lee

Math. Program., 2022

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

[BibT_eX]

[DOI]

Math. Program., 2022

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

[BibT_eX]

[DOI]

Ruiwei Jiang

EURO J. Comput. Optim., 2022

2021

Integer Programming for Learning Directed Acyclic Graphs from Continuous Data.

[BibT_eX]

[DOI]

INFORMS J. Optim., January, 2021

A polyhedral approach to bisubmodular function minimization.

[BibT_eX]

[DOI]

Qimeng Yu

Oper. Res. Lett., 2021

An exact cutting plane method for k-submodular function maximization.

[BibT_eX]

[DOI]

Qimeng Yu

Discret. Optim., 2021

2020

An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2020

Risk aversion to parameter uncertainty in Markov decision processes with an application to slow-onset disaster relief.

[BibT_eX]

[DOI]

Merve Merakli

IISE Trans., 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

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

[BibT_eX]

[DOI]

Linchuan Wei

Andrés Gómez

Proceedings of the Integer Programming and Combinatorial Optimization, 2020

2019

Probabilistic Partial Set Covering with an Oracle for Chance Constraints.

[BibT_eX]

[DOI]

SIAM J. Optim., 2019

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

[BibT_eX]

[DOI]

Fatma Kilinç-Karzan

Math. Program., 2019

Integer Programming for Learning Directed Acyclic Graphs from Continuous Data.

[BibT_eX]

[DOI]

Hasan Manzour

Ali Shojaie

CoRR, 2019

2018

Vector-valued multivariate conditional value-at-risk.

[BibT_eX]

[DOI]

Merve Merakli

Oper. Res. Lett., 2018

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

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2018

A polyhedral study of the static probabilistic lot-sizing problem.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2018

2017

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

[BibT_eX]

[DOI]

Birce Tezel

SIAM J. Optim., 2017

Robust multicriteria risk-averse stochastic programming models.

[BibT_eX]

[DOI]

Nilay Noyan

Ann. Oper. Res., 2017

2016

On a cardinality-constrained transportation problem with market choice.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2016

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

[BibT_eX]

[DOI]

Andrés Gómez

Networks, 2016

Decomposition algorithms for two-stage chance-constrained programs.

[BibT_eX]

[DOI]

James R. Luedtke

Math. Program., 2016

Cut generation for optimization problems with multivariate risk constraints.

[BibT_eX]

[DOI]

Nilay Noyan

Math. Program., 2016

A polyhedral study of production ramping.

[BibT_eX]

[DOI]

Math. Program., 2016

2015

On the transportation problem with market choice.

[BibT_eX]

[DOI]

Pelin Damci-Kurt

Santanu S. Dey

Discret. Appl. Math., 2015

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

[BibT_eX]

[DOI]

CoRR, 2015

2014

Finitely Convergent Decomposition Algorithms for Two-Stage Stochastic Pure Integer Programs.

[BibT_eX]

[DOI]

Minjiao Zhang

SIAM J. Optim., 2014

Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs.

[BibT_eX]

[DOI]

Dinakar Gade

Suvrajeet Sen

Math. Program., 2014

A Branch-and-Cut Method for Dynamic Decision Making Under Joint Chance Constraints.

[BibT_eX]

[DOI]

Minjiao Zhang

Saumya Goel

Manag. Sci., 2014

Chance-Constrained Binary Packing Problems.

[BibT_eX]

[DOI]

Yongjia Song

James R. Luedtke

INFORMS J. Comput., 2014

On a Cardinality-Constrained Transportation Problem With Market Choice.

[BibT_eX]

[DOI]

Pelin Damci-Kurt

Santanu S. Dey

CoRR, 2014

2012

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

[BibT_eX]

[DOI]

Binyuan Chen

Suvrajeet Sen

Oper. Res. Lett., 2012

On mixing sets arising in chance-constrained programming.

[BibT_eX]

[DOI]

Math. Program., 2012

A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands.

[BibT_eX]

[DOI]

Minjiao Zhang

Hande Yaman

Oper. Res., 2012

2011

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

[BibT_eX]

[DOI]

Binyuan Chen

Suvrajeet Sen

Oper. Res., 2011

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

[BibT_eX]

[DOI]

Dinakar Gade

Discret. Optim., 2011

2009

Uncapacitated lot sizing with backlogging: the convex hull.

[BibT_eX]

[DOI]

Yves Pochet

Math. Program., 2009

2008

On stochastic lot-sizing problems with random lead times.

[BibT_eX]

[DOI]

Kai Huang

Oper. Res. Lett., 2008

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

[BibT_eX]

[DOI]

Oper. Res. Lett., 2008

Branch-and-price-and-cut algorithms for solving the reliable <i>h</i> -paths problem.

[BibT_eX]

[DOI]

April K. Andreas

J. Cole Smith

J. Glob. Optim., 2008

2005

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

[BibT_eX]

[DOI]