David T. Mildebrath

According to our database, David T. Mildebrath authored at least 7 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Characterizing Rational Transplant Program Response to Outcome-Based Regulation.

David T. Mildebrath, Taewoo Lee, Saumya Sinha, Andrew J. Schaefer, A. Osama Gaber

Oper. Res., 2024

2023

A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty.

Bernard Knueven, David T. Mildebrath, Christopher Muir, John D. Siirola, Jean-Paul Watson, David L. Woodruff

Math. Program. Comput., December, 2023

A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation.

David T. Mildebrath

Optim. Lett., March, 2023

2022

An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs.

Logan A. Smith, David T. Mildebrath, Illya V. Hicks

Networks, 2022

2020

Relating single-scenario facets to the convex hull of the extensive form of a stochastic single-node flow polytope.

David T. Mildebrath, Victor Gonzalez, Mehdi Hemmati, Andrew J. Schaefer

Oper. Res. Lett., 2020

Optimal jersey retirement in the National Basketball Association.

David T. Mildebrath, Wendy Knight, Andrew J. Schaefer

IISE Trans., 2020

2019

A Polynomial Time Algorithm for Computing the Strong Rainbow Connection Numbers of Odd Cacti.

Logan A. Smith, David T. Mildebrath, Illya V. Hicks

CoRR, 2019