Brady Hunsaker

Orcid: 0009-0006-8156-217X

According to our database1, Brady Hunsaker authored at least 12 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Easy and hard separation of sparse and dense odd-set constraints in matching.
Discret. Optim., 2024

2011
Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs.
INFORMS J. Comput., 2011

How much do we "pay" for using default parameters?
Comput. Optim. Appl., 2011

2010
Maximizing the Efficiency of the U.S. Liver Allocation System Through Region Design.
Manag. Sci., 2010

2009
Interconnect customization for a hardware fabric.
ACM Trans. Design Autom. Electr. Syst., 2009

2008
Polarity and the complexity of the shooting experiment.
Discret. Optim., 2008

2007
Interconnect Customization for a Coarse-grained Reconfigurable Fabric.
Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

2006
Two-stage integer programs with stochastic right-hand sides: a superadditive dual approach.
Math. Program., 2006

A Low-Energy Reconfigurable Fabric for the SuperCISC Architecture.
J. Low Power Electron., 2006

2005
Simple lifted cover inequalities and hard knapsack problems.
Discret. Optim., 2005

2003
Optimal Online Algorithms for Minimax Resource Scheduling.
SIAM J. Discret. Math., 2003

2002
Efficient feasibility testing for dial-a-ride problems.
Oper. Res. Lett., 2002


  Loading...