Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts. - Douglas S. Altner; Özlem Ergun (CPAIOR, 2008)

Advancements on problems involving maximum flows. - Douglas S. Altner (2008)

The Maximum Flow Network Interdiction Problem: Valid inequalities, integrality gaps, and approximability. - Douglas S. Altner; Özlem Ergun; Nelson A. Uhan (Oper. Res. Lett., 2010)

Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems. - Douglas S. Altner; Özlem Ergun (Ann. Oper. Res., 2011)

Coverings and matchings in r-partite hypergraphs. - Douglas S. Altner; J. Paul Brooks (Networks, 2012)

A two-stage stochastic program for multi-shift, multi-analyst, workforce optimization with multiple on-call options. - Douglas S. Altner; Anthony C. Rojas; Leslie D. Servi (J. Sched., 2018)

Two-stage stochastic days-off scheduling of multi-skilled analysts with training options. - Douglas S. Altner; Erica K. Mason; Leslie D. Servi (J. Comb. Optim., 2019)