default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames R. Luedtke
Person information
- affiliation: University of Wisconsin-Madison, Department of Industrial and Systems Engineering, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2007
[b1]James R. Luedtke:
Integer Programming Approaches for Some Non-convex and Stochastic Optimization Problems. Georgia Institute of Technology, Atlanta, GA, USA, 2007
Journal Articles
- 2025
- [j44]Akhilesh Soni
, Jeff T. Linderoth, James R. Luedtke, Daniel L. Pimentel-Alarcón:
An Integer Programming Approach to Subspace Clustering with Missing Data. INFORMS J. Optim. 7(2): 83-104 (2025) - 2024
- [j43]Maryam Daryalal, Merve Bodur, James R. Luedtke:
Lagrangian Dual Decision Rules for Multistage Stochastic Mixed-Integer Programming. Oper. Res. 72(2): 717-737 (2024) - [j42]Rui Chen, James R. Luedtke:
Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables. Math. Program. 206(1): 357-388 (2024) - [j41]Rohit Kannan, Güzin Bayraksan, James R. Luedtke:
Residuals-based distributionally robust optimization with covariate information. Math. Program. 207(1): 369-425 (2024) - 2023
- [j40]Zeyang Zhang, Chuanhou Gao, James R. Luedtke:
New valid inequalities and formulations for the static joint Chance-constrained Lot-sizing problem. Math. Program. 199(1): 639-669 (2023) - 2022
- [j39]Rui Chen, James R. Luedtke:
On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs. INFORMS J. Comput. 34(4): 2332-2349 (2022) - [j38]Eli Towle, James R. Luedtke:
Intersection Disjunctions for Reverse Convex Sets. Math. Oper. Res. 47(1): 297-319 (2022) - [j37]Merve Bodur, James R. Luedtke:
Two-stage linear decision rules for multi-stage stochastic programming. Math. Program. 191(1): 347-380 (2022) - [j36]Santanu S. Dey, James R. Luedtke, Nikolaos V. Sahinidis:
Special Issue: Global Solution of Integer, Stochastic and Nonconvex Optimization Problems. Math. Program. 196(1): 1-8 (2022) - [j35]Rui Chen, James R. Luedtke:
On sample average approximation for two-stage stochastic programs without relatively complete recourse. Math. Program. 196(1): 719-754 (2022) - 2021
- [j34]Cong Han Lim, Jeffrey T. Linderoth, James R. Luedtke, Stephen J. Wright:
Parallelizing Subgradient Methods for the Lagrangian Dual in Stochastic Mixed-Integer Programming. INFORMS J. Optim. 3(1): 1-22 (2021) - [j33]Ashutosh Mahajan, Sven Leyffer, Jeff T. Linderoth, James R. Luedtke, Todd S. Munson:
Minotaur: a mixed-integer nonlinear optimization toolkit. Math. Program. Comput. 13(2): 301-338 (2021) - [j32]Rohit Kannan, James R. Luedtke:
A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs. Math. Program. Comput. 13(4): 705-751 (2021) - 2020
- [j31]James R. Luedtke, Claudia D'Ambrosio, Jeff T. Linderoth, Jonas Schweiger:
Strong Convex Nonlinear Relaxations of the Pooling Problem. SIAM J. Optim. 30(2): 1582-1609 (2020) - [j30]Alejandra Peña-Ordieres, James R. Luedtke, Andreas Wächter:
Solving Chance-Constrained Problems via a Smooth Sample-Based Nonlinear Approximation. SIAM J. Optim. 30(3): 2221-2250 (2020) - 2019
- [j29]Kaiyue Zheng, Laura A. Albert, James R. Luedtke, Eli Towle:
A budgeted maximum multiple coverage model for cybersecurity planning and management. IISE Trans. 51(12): 1303-1317 (2019) - 2018
- [j28]Eli Towle, James R. Luedtke:
New solution approaches for the maximum-reliability stochastic network interdiction problem. Comput. Manag. Sci. 15(3-4): 455-477 (2018) - [j27]David Coudert, James R. Luedtke, Eduardo Moreno, Konstantinos Priftis:
Computing and maximizing the exact reliability of wireless backhaul networks. Electron. Notes Discret. Math. 64: 85-94 (2018) - [j26]Thai Dinh, Ricardo Fukasawa, James R. Luedtke:
Exact algorithms for the chance-constrained vehicle routing problem. Math. Program. 172(1-2): 105-138 (2018) - [j25]Cong Han Lim, Jeff T. Linderoth, James R. Luedtke:
Valid inequalities for separable concave constraints with indicator variables. Math. Program. 172(1-2): 415-442 (2018) - [j24]Merve Bodur, James R. Luedtke:
Integer programming formulations for minimum deficiency interval coloring. Networks 72(2): 249-271 (2018) - [j23]Natashia Boland, Jeffrey Christiansen, Brian C. Dandurand, Andrew C. Eberhard, Jeff T. Linderoth, James R. Luedtke, Fabricio Oliveira:
Combining Progressive Hedging with a Frank-Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming. SIAM J. Optim. 28(2): 1312-1336 (2018) - 2017
- [j22]Merve Bodur, Sanjeeb Dash, Oktay Günlük, James R. Luedtke:
Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse. INFORMS J. Comput. 29(1): 77-91 (2017) - [j21]Merve Bodur, James R. Luedtke:
Mixed-Integer Rounding Enhanced Benders Decomposition for Multiclass Service-System Staffing and Scheduling with Arrival Rate Uncertainty. Manag. Sci. 63(7): 2073-2091 (2017) - [j20]Shabbir Ahmed, James R. Luedtke, Yongjia Song, Weijun Xie:
Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs. Math. Program. 162(1-2): 51-81 (2017) - [j19]Mustafa R. Kilinç, Jeff T. Linderoth, James R. Luedtke:
Lift-and-project cuts for convex mixed integer nonlinear programs. Math. Program. Comput. 9(4): 499-526 (2017) - 2016
- [j18]Burak Kocuk, Hyemin Jeon, Santanu S. Dey, Jeff T. Linderoth, James R. Luedtke, Xu Andy Sun:
A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching. Oper. Res. 64(4): 922-938 (2016) - [j17]Alexander Kogan, Miguel A. Lejeune, James R. Luedtke:
Erratum to: Threshold Boolean form for joint probabilistic constraints with random technology matrix. Math. Program. 155(1-2): 617-620 (2016) - [j16]Xiao Liu, Simge Küçükyavuz, James R. Luedtke:
Decomposition algorithms for two-stage chance-constrained programs. Math. Program. 157(1): 219-243 (2016) - 2015
- [j15]Yongjia Song, James R. Luedtke:
An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse. SIAM J. Optim. 25(3): 1344-1367 (2015) - 2014
- [j14]Mustafa R. Kilinç, Jeff T. Linderoth, James R. Luedtke, Andrew Miller:
Strong-branching inequalities for convex mixed integer nonlinear programs. Comput. Optim. Appl. 59(3): 639-665 (2014) - [j13]Yongjia Song, James R. Luedtke, Simge Küçükyavuz:
Chance-Constrained Binary Packing Problems. INFORMS J. Comput. 26(4): 735-747 (2014) - [j12]Mahdi Hamzeei, James R. Luedtke:
Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation. J. Glob. Optim. 59(2-3): 343-365 (2014) - [j11]Srikrishna Sridhar, Jeffrey T. Linderoth, James R. Luedtke:
Models and solution techniques for production planning problems with increasing byproducts. J. Glob. Optim. 59(2-3): 597-631 (2014) - [j10]James R. Luedtke:
A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support. Math. Program. 146(1-2): 219-244 (2014) - 2013
- [j9]Pietro Belotti, Christian Kirches, Sven Leyffer, Jeff T. Linderoth, James R. Luedtke, Ashutosh Mahajan:
Mixed-integer nonlinear optimization. Acta Numer. 22: 1-131 (2013) - [j8]Yongjia Song, James R. Luedtke:
Branch-and-cut approaches for chance-constrained formulations of reliable network design problems. Math. Program. Comput. 5(4): 397-432 (2013) - [j7]Srikrishna Sridhar, Jeff T. Linderoth, James R. Luedtke:
Locally ideal formulations for piecewise linear functions with indicator variables. Oper. Res. Lett. 41(6): 627-632 (2013) - 2012
- [j6]James R. Luedtke, Mahdi Namazifar, Jeff T. Linderoth:
Some results on the strength of relaxations of multilinear functions. Math. Program. 136(2): 325-351 (2012) - 2010
- [j5]Itai Gurvich, James R. Luedtke, Tolga Tezcan:
Staffing Call Centers with Uncertain Demand Forecasts: A Chance-Constrained Optimization Approach. Manag. Sci. 56(7): 1093-1115 (2010) - [j4]James R. Luedtke, Shabbir Ahmed, George L. Nemhauser:
An integer programming approach for linear programs with probabilistic constraints. Math. Program. 122(2): 247-272 (2010) - 2009
- [j3]James R. Luedtke, George L. Nemhauser:
Strategic Planning with Start-Time Dependent Variable Costs. Oper. Res. 57(5): 1250-1261 (2009) - 2008
- [j2]James R. Luedtke, Shabbir Ahmed:
A Sample Approximation Approach for Optimization with Probabilistic Constraints. SIAM J. Optim. 19(2): 674-699 (2008) - [j1]James R. Luedtke:
New Formulations for Optimization under Stochastic Dominance Constraints. SIAM J. Optim. 19(3): 1433-1450 (2008)
Conference and Workshop Papers
- 2022
- [c7]Rui Chen, James R. Luedtke:
Sparse Multi-term Disjunctive Cuts for the Epigraph of a Function of Binary Variables. IPCO 2022: 98-111 - 2016
- [c6]Thai Dinh, Ricardo Fukasawa, James R. Luedtke:
Exact Algorithms for the Chance-Constrained Vehicle Routing Problem. IPCO 2016: 89-101 - [c5]Cong Han Lim, Jeff T. Linderoth, James R. Luedtke:
Valid Inequalities for Separable Concave Constraints with Indicator Variables. IPCO 2016: 275-286 - 2011
- [c4]Claudia D'Ambrosio, Jeff T. Linderoth, James R. Luedtke:
Valid Inequalities for the Pooling Problem with Binary Variables. IPCO 2011: 117-129 - 2010
- [c3]James R. Luedtke:
An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs. IPCO 2010: 271-284 - 2007
- [c2]James R. Luedtke, Shabbir Ahmed, George L. Nemhauser:
An Integer Programming Approach for Linear Programs with Probabilistic Constraints. IPCO 2007: 410-423 - 2004
- [c1]James R. Luedtke, Chelsea C. White III:
The value of asset visibility in the supply chain single and dual source models. SMC (5) 2004: 4189-4194
Coauthor Index
aka: Jeffrey T. Linderoth
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-06-16 23:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
