An improved branch-and-bound algorithm for the one-machine scheduling problem with delayed precedence constraints

von Zhang, Wenda
Veröffentlicht in Institute for Operations Research and the Management Sciences INFORMS journal on computing (2021)

Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search

von Zhang, Wenda
Veröffentlicht in Computers & operations research (2021)

Duality in balance optimization subset selection

von Kwon, Hee Youn
Veröffentlicht in Annals of operations research ; volume 289, number 2 (June 2020) (2020)

A network simplex algorithm for the equal flow problem on a generalized network

von Morrison, David Robert
Veröffentlicht in Institute for Operations Research and the Management Sciences INFORMS journal on computing (2013)

Complexity and approximation results for the balance optimization subset selection model for causal inference in observational studies

von Sauppe, Jason J.
Veröffentlicht in Institute for Operations Research and the Management Sciences INFORMS journal on computing (2014)

Assigning panels to meeting rooms at the national science foundation

von Sauppe, Jason J.
Veröffentlicht in Interfaces (-)

A wide branching strategy for the graph coloring problem

Veröffentlicht in Institute for Operations Research and the Management Sciences INFORMS journal on computing (2014)