Sciweavers

235 search results - page 14 / 47
» A Practical Mix
Sort
View
INFORMS
2006
87views more  INFORMS 2006»
13 years 9 months ago
Early Estimates of the Size of Branch-and-Bound Trees
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
Gérard Cornuéjols, Miroslav Karamano...
MP
2010
128views more  MP 2010»
13 years 8 months ago
Perspective reformulations of mixed integer nonlinear programs with indicator variables
Abstract. We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision ...
Oktay Günlük, Jeff Linderoth
ASIACRYPT
2007
Springer
14 years 4 months ago
How to Build a Hash Function from Any Collision-Resistant Function
Recent collision-finding attacks against hash functions such as MD5 and SHA-1 motivate the use of provably collision-resistant (CR) functions in their place. Finding a collision ...
Thomas Ristenpart, Thomas Shrimpton
PPSN
2004
Springer
14 years 3 months ago
Spread of Vector Borne Diseases in a Population with Spatial Structure
Mathematical modeling of the spread of infectious diseases is a well established field with high practical importance. Underlying most analytical approaches is the assumption of ...
Dominique Chu, Jonathan E. Rowe
PLDI
2010
ACM
14 years 3 months ago
Mixing type checking and symbolic execution
Static analysis designers must carefully balance precision and efficiency. In our experience, many static analysis tools are built around an elegant, core algorithm, but that alg...
Yit Phang Khoo, Bor-Yuh Evan Chang, Jeffrey S. Fos...