The value of asset visibility in the supply chain single and dual source models. - James R. Luedtke; Chelsea C. White III (SMC (5), 2004)

An Integer Programming Approach for Linear Programs with Probabilistic Constraints. - James R. Luedtke; Shabbir Ahmed 001; George L. Nemhauser (IPCO, 2007)

Integer Programming Approaches for Some Non-convex and Stochastic Optimization Problems. - James R. Luedtke (2007)

New Formulations for Optimization under Stochastic Dominance Constraints. - James R. Luedtke (SIAM J. Optim., 2008)

A Sample Approximation Approach for Optimization with Probabilistic Constraints. - James R. Luedtke; Shabbir Ahmed 001 (SIAM J. Optim., 2008)

Strategic Planning with Start-Time Dependent Variable Costs. - James R. Luedtke; George L. Nemhauser (Oper. Res., 2009)

An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs. - James R. Luedtke (IPCO, 2010)

Staffing Call Centers with Uncertain Demand Forecasts: A Chance-Constrained Optimization Approach. - Itai Gurvich; James R. Luedtke; Tolga Tezcan (Manag. Sci., 2010)

Valid Inequalities for the Pooling Problem with Binary Variables. - Claudia D'Ambrosio; Jeff T. Linderoth; James R. Luedtke (IPCO, 2011)

Some results on the strength of relaxations of multilinear functions. - James R. Luedtke; Mahdi Namazifar; Jeff T. Linderoth (Math. Program., 2012)

Mixed-integer nonlinear optimization. - Pietro Belotti; Christian Kirches; Sven Leyffer; Jeff T. Linderoth; James R. Luedtke; Ashutosh Mahajan (Acta Numer., 2013)

Branch-and-cut approaches for chance-constrained formulations of reliable network design problems. - Yongjia Song; James R. Luedtke (Math. Program. Comput., 2013)

Locally ideal formulations for piecewise linear functions with indicator variables. - Srikrishna Sridhar; Jeff T. Linderoth; James R. Luedtke (Oper. Res. Lett., 2013)

Strong-branching inequalities for convex mixed integer nonlinear programs. - Mustafa R. Kilinç; Jeff T. Linderoth; James R. Luedtke; Andrew Miller (Comput. Optim. Appl., 2014)

Chance-Constrained Binary Packing Problems. - Yongjia Song; James R. Luedtke; Simge Küçükyavuz (INFORMS J. Comput., 2014)

Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation. - Mahdi Hamzeei; James R. Luedtke (J. Glob. Optim., 2014)

Models and solution techniques for production planning problems with increasing byproducts. - Srikrishna Sridhar; Jeffrey T. Linderoth; James R. Luedtke (J. Glob. Optim., 2014)

A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support. - James R. Luedtke (Math. Program., 2014)

An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse. - Yongjia Song; James R. Luedtke (SIAM J. Optim., 2015)

Exact Algorithms for the Chance-Constrained Vehicle Routing Problem. - Thai Dinh; Ricardo Fukasawa; James R. Luedtke (IPCO, 2016)

Valid Inequalities for Separable Concave Constraints with Indicator Variables. - Cong Han Lim; Jeff T. Linderoth; James R. Luedtke (IPCO, 2016)

A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching. - Burak Kocuk; Hyemin Jeon; Santanu S. Dey; Jeff T. Linderoth; James R. Luedtke; Xu Andy Sun (Oper. Res., 2016)

Erratum to: Threshold Boolean form for joint probabilistic constraints with random technology matrix. - Alexander Kogan; Miguel A. Lejeune; James R. Luedtke (Math. Program., 2016)

Decomposition algorithms for two-stage chance-constrained programs. - Xiao Liu; Simge Küçükyavuz; James R. Luedtke (Math. Program., 2016)

Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse. - Merve Bodur; Sanjeeb Dash; Oktay Günlük; James R. Luedtke (INFORMS J. Comput., 2017)

Mixed-Integer Rounding Enhanced Benders Decomposition for Multiclass Service-System Staffing and Scheduling with Arrival Rate Uncertainty. - Merve Bodur; James R. Luedtke (Manag. Sci., 2017)

Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs. - Shabbir Ahmed 001; James R. Luedtke; Yongjia Song; Weijun Xie 001 (Math. Program., 2017)

Lift-and-project cuts for convex mixed integer nonlinear programs. - Mustafa R. Kilinç; Jeff T. Linderoth; James R. Luedtke (Math. Program. Comput., 2017)

New solution approaches for the maximum-reliability stochastic network interdiction problem. - Eli Towle; James R. Luedtke (Comput. Manag. Sci., 2018)

Computing and maximizing the exact reliability of wireless backhaul networks. - David Coudert; James R. Luedtke; Eduardo Moreno 001; Konstantinos Priftis (Electron. Notes Discret. Math., 2018)

Integer programming formulations for minimum deficiency interval coloring. - Merve Bodur; James R. Luedtke (Networks, 2018)

Combining Progressive Hedging with a Frank-Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming. - Natashia Boland; Jeffrey Christiansen; Brian C. Dandurand; Andrew C. Eberhard; Jeff T. Linderoth; James R. Luedtke; Fabricio Oliveira (SIAM J. Optim., 2018)

A budgeted maximum multiple coverage model for cybersecurity planning and management. - Kaiyue Zheng; Laura A. Albert; James R. Luedtke; Eli Towle (IISE Trans., 2019)

Strong Convex Nonlinear Relaxations of the Pooling Problem. - James R. Luedtke; Claudia D'Ambrosio; Jeff T. Linderoth; Jonas Schweiger (SIAM J. Optim., 2020)

Solving Chance-Constrained Problems via a Smooth Sample-Based Nonlinear Approximation. - Alejandra Peña-Ordieres; James R. Luedtke; Andreas Wächter (SIAM J. Optim., 2020)

A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs. - Rohit Kannan; James R. Luedtke (Math. Program. Comput., 2021)

Minotaur: a mixed-integer nonlinear optimization toolkit. - Ashutosh Mahajan; Sven Leyffer; Jeff T. Linderoth; James R. Luedtke; Todd S. Munson (Math. Program. Comput., 2021)

Parallelizing Subgradient Methods for the Lagrangian Dual in Stochastic Mixed-Integer Programming. - Cong Han Lim; Jeffrey T. Linderoth; James R. Luedtke; Stephen J. Wright 001 (INFORMS J. Optim., 2021)

Sparse Multi-term Disjunctive Cuts for the Epigraph of a Function of Binary Variables. - Rui Chen; James R. Luedtke (IPCO, 2022)

On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs. - Rui Chen; James R. Luedtke (INFORMS J. Comput., 2022)

Intersection Disjunctions for Reverse Convex Sets. - Eli Towle; James R. Luedtke (Math. Oper. Res., 2022)

Two-stage linear decision rules for multi-stage stochastic programming. - Merve Bodur; James R. Luedtke (Math. Program., 2022)

On sample average approximation for two-stage stochastic programs without relatively complete recourse. - Rui Chen; James R. Luedtke (Math. Program., 2022)

Special Issue: Global Solution of Integer, Stochastic and Nonconvex Optimization Problems. - Santanu S. Dey; James R. Luedtke; Nikolaos V. Sahinidis (Math. Program., 2022)

New valid inequalities and formulations for the static joint Chance-constrained Lot-sizing problem. - Zeyang Zhang; Chuanhou Gao; James R. Luedtke (Math. Program., 2023)

Lagrangian Dual Decision Rules for Multistage Stochastic Mixed-Integer Programming. - Maryam Daryalal; Merve Bodur; James R. Luedtke (Oper. Res., 2024)

Residuals-based distributionally robust optimization with covariate information. - Rohit Kannan; Güzin Bayraksan; James R. Luedtke (Math. Program., 2024)

An Integer Programming Approach to Subspace Clustering with Missing Data. - Akhilesh Soni; Jeff T. Linderoth; James R. Luedtke; Daniel L. Pimentel-Alarcón (INFORMS J. Optim., 2025)

On Integer Programming for the Binarized Neural Network Verification Problem. - Woojin Kim; James R. Luedtke (CoRR, 2025)