Efficient feasibility testing for dial-a-ride problems. - Brady Hunsaker; Martin W. P. Savelsbergh (Oper. Res. Lett., 2002)

Optimal Online Algorithms for Minimax Resource Scheduling. - Brady Hunsaker; Anton J. Kleywegt; Martin W. P. Savelsbergh; Craig A. Tovey (SIAM J. Discret. Math., 2003)

Simple lifted cover inequalities and hard knapsack problems. - Brady Hunsaker; Craig A. Tovey (Discret. Optim., 2005)

A Low-Energy Reconfigurable Fabric for the SuperCISC Architecture. - Gayatri Mehta; Justin Stander; Joshua M. Lucas; Raymond R. Hoare; Brady Hunsaker; Alex K. Jones (J. Low Power Electron., 2006)

Two-stage integer programs with stochastic right-hand sides: a superadditive dual approach. - Nan Kong; Andrew J. Schaefer; Brady Hunsaker (Math. Program., 2006)

Interconnect Customization for a Coarse-grained Reconfigurable Fabric. - Gayatri Mehta; Justin Stander; Mustafa Baz; Brady Hunsaker; Alex K. Jones (IPDPS, 2007)

Polarity and the complexity of the shooting experiment. - Brady Hunsaker; Ellis L. Johnson; Craig A. Tovey (Discret. Optim., 2008)

Interconnect customization for a hardware fabric. - Gayatri Mehta; Justin Stander; Mustafa Baz; Brady Hunsaker; Alex K. Jones (ACM Trans. Design Autom. Electr. Syst., 2009)

Maximizing the Efficiency of the U.S. Liver Allocation System Through Region Design. - Nan Kong; Andrew J. Schaefer; Brady Hunsaker; Mark S. Roberts (Manag. Sci., 2010)

How much do we "pay" for using default parameters? - Mustafa Baz; Brady Hunsaker; Oleg A. Prokopyev (Comput. Optim. Appl., 2011)

Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs. - Osman Y. Özaltin; Brady Hunsaker; Andrew J. Schaefer (INFORMS J. Comput., 2011)

Easy and hard separation of sparse and dense odd-set constraints in matching. - Brady Hunsaker; Craig A. Tovey (Discret. Optim., 2024)