This paper deals with an NP-hard bi-objective one-machine problem with ready times involving maximum lateness and unit family setup cost objectives. Considering separately both ob...
Christian Artigues, Nicolas Jozefowiez, Mohamed Al...
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
We study the biochemical processes involved in scaffold-mediated crosstalk between the cAMP and the Raf-1/MEK/ERK pathways. We model the system by a continuous time Markov chain w...
mented Abstractions Matt Eldera,1 , Denis Gopanb,2 , and Thomas Repsa,b,3 a Computer Sciences Department, Univ. of Wisconsin; Madison, WI; USA b GrammaTech, Inc.; Ithaca, NY; USA ...
s as an Abstract Domain Jacob M. Howe1,4 Dept of Computing, City University London, UK Andy King1,3,5 School of Computing, University of Kent, Canterbury, UK Charles Lawrence-Jones...