Solving the Resource Constrained Project Scheduling Problem with Generalized Precedences by Lazy Clause Generation

The technical report presents a generic exact solution approach for minimizing the project duration of the resource-constrained project scheduling problem with generalized precedences (Rcpsp/max). The approach uses lazy clause generation, i.e., a hybrid of finite domain and Boolean satisfiability solving, in order to apply nogood learning and conflict-driven search on the solution generation. Our experiments show the benefit of lazy clause generation for finding an optimal solutions and proving its optimality in comparison to other state-of-the-art exact and non-exact methods. The method is highly robust: it matched or bettered the best known results on all of the 2340 instances we examined except 3, according to the currently available data on the PSPLib. Of the 631 open instances in this set it closed 573 and improved the bounds of 51 of the remaining 58 instances.Comment: 37 pages, 3 figures, 16 table

Collective proposal distributions for nonlinear MCMC samplers : Mean-field theory and fast implementation

Funding Information: ∗This research was conducted while A.D. was supported by an EPSRC-Roth scholarship co-funded by the Engineering and Physical Sciences Research Council and the Department of Mathematics at Imperial College London. Publisher Copyright: © 2022, Institute of Mathematical Statistics. All rights reserved.Over the last decades, various “non-linear” MCMC methods have arisen. While appealing for their convergence speed and efficiency, their practical implementation and theoretical study remain challenging. In this paper, we introduce a non-linear generalization of the Metropolis-Hastings algorithm to a proposal that depends not only on the current state, but also on its law. We propose to simulate this dynamics as the mean field limit of a system of interacting particles, that can in turn itself be understood as a generalisation of the Metropolis-Hastings algorithm to a population of particles. Under the double limit in number of iterations and number of particles we prove that this algorithm converges. Then, we propose an efficient GPU implementation and illustrate its performance on various examples. The method is particularly stable on multimodal examples and converges faster than the classical methods.Peer reviewe

August Strobel et Stephan Wimmer, Kallirrhoë (‘Ēn ez-Zāra). Dritte Grabungskampagne des Deutschen evangelischen Instituts für Altertumswissenschaft des Heiligen Landes und Exkursionen in Süd-Peräa

L’oasis de ‘Aïn ez-Zâra (Jordanie) est située sur le rivage nord-est de la mer Morte dans un environnement de hautes falaises, au sud de la gorge du wadi Zarqâ Ma‘în. Cette oasis, qui s’est développée grâce à la présence de nombreuses sources pérennes chaudes, conserve sur une surface d’environ 2 km2 différents vestiges archéologiques à l’intérieur d’un rempart. De ce fait, ce site a été identifié comme l’ancienne Callirrhoé, une station thermale où Hérode le Grand chercha à la fin de sa vie ..

August Strobel et Stephan Wimmer, Kallirrhoë (‘Ēn ez-Zāra). Dritte Grabungskampagne des Deutschen evangelischen Instituts für Altertumswissenschaft des Heiligen Landes und Exkursionen in Süd-Peräa

L’oasis de ‘Aïn ez-Zâra (Jordanie) est située sur le rivage nord-est de la mer Morte dans un environnement de hautes falaises, au sud de la gorge du wadi Zarqâ Ma‘în. Cette oasis, qui s’est développée grâce à la présence de nombreuses sources pérennes chaudes, conserve sur une surface d’environ 2 km2 différents vestiges archéologiques à l’intérieur d’un rempart. De ce fait, ce site a été identifié comme l’ancienne Callirrhoé, une station thermale où Hérode le Grand chercha à la fin de sa vie ..