d Abstract) Colin Cooper∗ , Martin Dyer† and Catherine Greenhill‡ We consider a simple Markov chain for d-regular graphs on n vertices, and show that the mixing time of this...
Colin Cooper, Martin E. Dyer, Catherine S. Greenhi...
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
The waiting time for patients in outpatient departments of hospitals is a problem throughout the world. In this context, a discrete-event-simulation model was developed to examine...
The manufacture of pre-cast concrete building elements consists of a few manufacturing steps. The process itself is simple, but the characteristics of the business are quite rando...
Abstract. CirCUs is a satisfiability solver that works on a combination of AndInverter-Graph, CNF clauses, and BDDs. It has been designed to work well with bounded model checking. ...