The DPLL procedure for the SAT problem is one of the fundamental algorithms in computer science, with many applications in a range of domains, including software and hardware veri...
We present an approximate dynamic programming approach for making ambulance redeployment decisions in an emergency medical service system. The primary decision is where we should ...
Matthew S. Maxwell, Mateo Restrepo, Shane G. Hende...
We develop a solution approach for the fixed charge network flow problem (FCNF) that produces provably high-quality solutions quickly. The solution approach combines mathematica...
Mike Hewitt, George L. Nemhauser, Martin W. P. Sav...
This paper introduces disjunctive decomposition for two-stage mixed 0-1 stochastic integer programs (SIPs) with random recourse. Disjunctive decomposition allows for cutting plane...
In this paper we present an attack to the BLOKE and BRAKE hash functions, which are weakened versions of the SHA-3 candidate BLAKE. In difference to BLAKE, the BLOKE hash functio...