| 2012 | ||
|---|---|---|
| j3 | Douglas S. Altner, J. Paul Brooks: Coverings and matchings in r-partite hypergraphs. Networks 59(4): 400-410 (2012) | |
| 2011 | ||
| j2 | Douglas S. Altner, Özlem Ergun: Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems. Annals OR 184(1): 3-26 (2011) | |
| 2010 | ||
| j1 | Douglas S. Altner, Özlem Ergun, Nelson A. Uhan: The Maximum Flow Network Interdiction Problem: Valid inequalities, integrality gaps, and approximability. Oper. Res. Lett. 38(1): 33-38 (2010) | |
| 2008 | ||
| c1 | Douglas S. Altner, Özlem Ergun: Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts. CPAIOR 2008: 283-287 | |
| 1 | J. Paul Brooks | |
| 2 | Özlem Ergun | |
| 3 | Nelson A. Uhan |
Data released under the ODC-BY 1.0 license — See also our legal information page