Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Nina Schiff
Daniel P. Kennedy
Dan Graur
Greeneich, E.W.
Barbara Aquilani
Richard Caballero
Roland Zumkeller
Maximilian Dürr
Liangliang Shang
Chen Ma
Home
/
Author
/
JAMES LUEDTKE
Author Info
Open Visualization
Name
Affiliation
Papers
JAMES LUEDTKE
Industrial and Systems Engineering, University of Wisconsin--Madison, Madison, Wisconsin 53706
33
Collaborators
Citations
PageRank
45
439
25.95
Referers
Referees
References
588
613
575
Search Limit
100
613
Publications (33 rows)
Collaborators (45 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Two-stage linear decision rules for multi-stage stochastic programming
0
0.34
2022
Intersection Disjunctions for Reverse Convex Sets
0
0.34
2022
A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs
0
0.34
2021
Minotaur: A Mixed-Integer Nonlinear Optimization Toolkit
0
0.34
2021
A budgeted maximum multiple coverage model for cybersecurity planning and management
2
0.37
2019
New solution approaches for the maximum-reliability stochastic network interdiction problem.
0
0.34
2018
Valid Inequalities for Separable Concave Constraints with Indicator Variables.
0
0.34
2018
Exact Algorithms for the Chance-Constrained Vehicle Routing Problem.
1
0.36
2018
Integer programming formulations for minimum deficiency interval coloring.
0
0.34
2018
Combining Progressive Hedging with a Frank-Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming.
3
0.36
2018
Computing and maximizing the exact reliability of wireless backhaul networks.
0
0.34
2018
Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs.
6
0.44
2017
Mixed-Integer Rounding Enhanced Benders Decomposition for Multiclass Service-System Staffing and Scheduling with Arrival Rate Uncertainty
6
0.43
2017
Strengthened Benders Cuts For Stochastic Integer Programs With Continuous Recourse
12
0.52
2017
Lift-and-project cuts for convex mixed integer nonlinear programs.
2
0.38
2017
Decomposition algorithms for two-stage chance-constrained programs
18
0.64
2016
Erratum to: Threshold Boolean form for joint probabilistic constraints with random technology matrix
2
0.37
2016
A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching
7
0.96
2016
An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse
6
0.41
2015
A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
24
0.87
2014
Strong-branching inequalities for convex mixed integer nonlinear programs
0
0.34
2014
Models and solution techniques for production planning problems with increasing byproducts
1
0.36
2014
Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
0
0.34
2014
Branch-and-cut approaches for chance-constrained formulations of reliable network design problems.
10
0.55
2013
Locally ideal formulations for piecewise linear functions with indicator variables
5
0.43
2013
Some results on the strength of relaxations of multilinear functions.
24
0.76
2012
Valid inequalities for the pooling problem with binary variables
9
0.51
2011
An integer programming approach for linear programs with probabilistic constraints
101
5.21
2010
An integer programming and decomposition approach to general chance-constrained mathematical programs
15
0.69
2010
Staffing Call Centers with Uncertain Demand Forecasts: A Chance-Constrained Optimization Approach
27
1.16
2010
Strategic Planning with Start-Time Dependent Variable Costs
0
0.34
2009
New Formulations for Optimization under Stochastic Dominance Constraints
26
1.20
2008
A Sample Approximation Approach for Optimization with Probabilistic Constraints
132
5.25
2008
1