Canceling most helpful total submodular cuts for submodular flow. - S. Thomas McCormick; Thomas R. Ervolina (IPCO, 1993)

Two Strongly Polynomial Cut Cancelling Algorithms for Minimum Cost Network Flow. - Thomas R. Ervolina; S. Thomas McCormick (Discret. Appl. Math., 1993)

Canceling most helpful total cuts for minimum cost network flow. - Thomas R. Ervolina; S. Thomas McCormick (Networks, 1993)

Computing Maximum Mean Cuts. - S. Thomas McCormick; Thomas R. Ervolina (Discret. Appl. Math., 1994)

Simulating order fulfillment with product substitutions in an assemble-to-order supply chain. - Thomas R. Ervolina; Markus Ettl; Young M. Lee; Daniel J. Peters (WSC, 2006)

Managing product availability in an assemble-to-order supply chain with multiple customer segments. - Thomas R. Ervolina; Markus Ettl; Young M. Lee; Daniel J. Peters (OR Spectr., 2009)