In practice, apart from the problem of vehicle routing, schedulers also face the problem of finding feasible driver schedules complying with complex restrictions on drivers’ driving and working hours. To address this complex interdependent problem of vehicle routing and break scheduling, we propose a restricted dynamic programming heuristic for the vehicle routing problem with time windows and ...

9:30 10:30 Michele Conforti 10:30 11:00 Coffee Break 11:00 11:30 Bernard Ries, “Some properties of edge intersection graphs of single bend paths on a grid” 11:30 12:00 Pierre Charbit,“Linear Time Split-Decomposition of undirected graphs” 12:00 3:30 Lunch and discussion 3:30 4:00 Nicholas Trotingnon, “The k-in-a-tree problem for graphs of girth at least k” 4:00 4:30 Maria Chudnovsky, “A splitter...

In this paper we break a 10-year's standing public key cryptosystem, Finite Automata Public Key Cryptosystem(FAPKC for short). The security of FAPKC was mainly based on the di culty of nding a special common left factor of two given matrix polynomials. We prove a simple but previously unknown property of the input-memory nite automata. By this property, we reduce the basis of the FAPKC's securi...

A model of ice floe break-up under ocean wave forcing in the marginal ice zone (MIZ) is proposed to investigate how floe size distribution (FSD) evolves under repeated wave break-up events. A three-dimensional linear model of ocean wave scattering by a finite array of compliant circular ice floes is coupled to a flexural failure model, which breaks a floe into two floes provided the two-dimensi...

We prove the weak consistency of the posterior distribution and that of the Bayes estimator for a two-phase piecewise linear regression mdoel where the break-point is unknown. The non-differentiability of the likelihood of the model with regard to the break-point parameter induces technical difficulties that we overcome by creating a regularised version of the problem at hand. We first recover ...

A quantitative comparison of the usual and recent numerical treatments which are applied to the Smoothed Particle Hydrodynamics (SPH) method are presented together with a new free-surface treatment. A series of numerical treatments are studied to refine the numerical procedures of the SPH method particularly for violent flows with a free surface. Two dimensional dam-break and sway-sloshing prob...

In the rendezvous search problem, two mobile agents must move along the n nodes of a network so as to minimize the time required to meet or rendezvous. When the mobile agents are identical and the network is anonymous, however, the resulting symmetry can make the problem impossible to solve. Symmetry is typically broken by having the mobile agents run either a randomized algorithm or different ...