Thomas R. Ervolina

According to our database, Thomas R. Ervolina authored at least 6 papers between 1993 and 2009.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2009

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

2006

Simulating order fulfillment with product substitutions in an assemble-to-order supply chain.

Thomas R. Ervolina, Markus Ettl, Young M. Lee, Daniel J. Peters

Proceedings of the Winter Simulation Conference WSC 2006, 2006

1994

Computing Maximum Mean Cuts.

S. Thomas McCormick, Thomas R. Ervolina

Discret. Appl. Math., 1994

1993

Canceling most helpful total cuts for minimum cost network flow.

Thomas R. Ervolina, S. Thomas McCormick

Networks, 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 submodular cuts for submodular flow.

S. Thomas McCormick, Thomas R. Ervolina

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993