James R. Luedtke
Orcid: 0000-0001-9265-7728Affiliations:
- University of Wisconsin-Madison, Department of Industrial and Systems Engineering, USA
According to our database1,
James R. Luedtke
authored at least 45 papers
between 2004 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2023
New valid inequalities and formulations for the static joint Chance-constrained Lot-sizing problem.
Math. Program., May, 2023
2022
Special Issue: Global Solution of Integer, Stochastic and Nonconvex Optimization Problems.
Math. Program., 2022
On sample average approximation for two-stage stochastic programs without relatively complete recourse.
Math. Program., 2022
Math. Program., 2022
INFORMS J. Comput., 2022
Sparse Multi-term Disjunctive Cuts for the Epigraph of a Function of Binary Variables.
Proceedings of the Integer Programming and Combinatorial Optimization, 2022
2021
Parallelizing Subgradient Methods for the Lagrangian Dual in Stochastic Mixed-Integer Programming.
INFORMS J. Optim., January, 2021
Math. Program. Comput., 2021
A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs.
Math. Program. Comput., 2021
2020
Solving Chance-Constrained Problems via a Smooth Sample-Based Nonlinear Approximation.
SIAM J. Optim., 2020
2019
A budgeted maximum multiple coverage model for cybersecurity planning and management.
IISE Trans., 2019
2018
Combining Progressive Hedging with a Frank-Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming.
SIAM J. Optim., 2018
Networks, 2018
Math. Program., 2018
Math. Program., 2018
Electron. Notes Discret. Math., 2018
New solution approaches for the maximum-reliability stochastic network interdiction problem.
Comput. Manag. Sci., 2018
2017
Math. Program. Comput., 2017
Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs.
Math. Program., 2017
Mixed-Integer Rounding Enhanced Benders Decomposition for Multiclass Service-System Staffing and Scheduling with Arrival Rate Uncertainty.
Manag. Sci., 2017
INFORMS J. Comput., 2017
2016
Math. Program., 2016
Erratum to: Threshold Boolean form for joint probabilistic constraints with random technology matrix.
Math. Program., 2016
A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching.
Oper. Res., 2016
2015
An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse.
SIAM J. Optim., 2015
2014
A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support.
Math. Program., 2014
Models and solution techniques for production planning problems with increasing byproducts.
J. Glob. Optim., 2014
Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation.
J. Glob. Optim., 2014
Comput. Optim. Appl., 2014
2013
Oper. Res. Lett., 2013
Branch-and-cut approaches for chance-constrained formulations of reliable network design problems.
Math. Program. Comput., 2013
2012
Math. Program., 2012
2011
Proceedings of the Integer Programming and Combinatoral Optimization, 2011
2010
Math. Program., 2010
Staffing Call Centers with Uncertain Demand Forecasts: A Chance-Constrained Optimization Approach.
Manag. Sci., 2010
An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010
2009
2008
SIAM J. Optim., 2008
SIAM J. Optim., 2008
2007
Integer Programming Approaches for Some Non-convex and Stochastic Optimization Problems.
PhD thesis, 2007
2004
Proceedings of the IEEE International Conference on Systems, 2004