To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
For multi-scale differential equations (or fast–slow equations), one often encounters problems in which a key system parameter slowly passes through a bifurcation. In this article, we show that a pair of prototypical reaction–diffusion equations in two space dimensions can exhibit delayed Hopf bifurcations. Solutions that approach attracting/stable states before the instantaneous Hopf point stay near these states for long, spatially dependent times after these states have become repelling/unstable. We use the complex Ginzburg–Landau equation and the Brusselator models as prototypes. We show that there exist two-dimensional spatio-temporal buffer surfaces and memory surfaces in the three-dimensional space-time. We derive asymptotic formulas for them for the complex Ginzburg–Landau equation and show numerically that they exist also for the Brusselator model. At each point in the domain, these surfaces determine how long the delay in the loss of stability lasts, that is, to leading order when the spatially dependent onset of the post-Hopf oscillations occurs. Also, the onset of the oscillations in these partial differential equations is a hard onset.
Quorum sensing governs bacterial communication, playing a crucial role in regulating population behaviour. We propose a mathematical model that uncovers chaotic dynamics within quorum sensing networks, highlighting challenges to predictability. The model explores interactions between autoinducers and two bacterial subtypes, revealing oscillatory dynamics in both a constant autoinducer submodel and the full three-component model. In the latter case, we find that the complicated dynamics can be explained by the presence of homoclinic Shilnikov bifurcations. We employ a combination of normal-form analysis and numerical continuation methods to analyse the system.
We study the planar FitzHugh–Nagumo system with an attracting periodic orbit that surrounds a repelling focus equilibrium. When the associated oscillation of the system is perturbed, in a given direction and with a given amplitude, there will generally be a change in phase of the perturbed oscillation with respect to the unperturbed one. This is recorded by the phase transition curve (PTC), which relates the old phase (along the periodic orbit) to the new phase (after perturbation). We take a geometric point of view and consider the phase-resetting surface comprising all PTCs as a function of the perturbation amplitude. This surface has a singularity when the perturbation maps a point on the periodic orbit exactly onto the repelling focus, which is the only point that does not return to stable oscillation. We also consider the PTC as a function of the direction of the perturbation and present how the corresponding phase-resetting surface changes with increasing perturbation amplitude. In this way, we provide a complete geometric interpretation of how the PTC changes for any perturbation direction. Unlike other examples discussed in the literature so far, the FitzHugh–Nagumo system is a generic example and, hence, representative for planar vector fields.
Macroscopically, a Darcian unsaturated moisture flow in the top soil is usually represented by an one-dimensional volume scale of evaporation from a static water table. On the microscale, simple pore-level models posit bundles of small-radius capillary tubes of a constant circular cross-section, fully occupied by mobile water moving in the Hagen–Poiseuille (HP) regime, while large-diameter pores are occupied by stagnant air. In our paper, cross-sections of cylindrical pores are polygonal. Steady, laminar, fully developed two-dimensional flows of Newtonian water in prismatic conduits, driven by a constant pressure gradient along a pore gradient, are more complex than the HP formula; this is based on the fact that the pores are only partially occupied by water and immobile air. The Poisson equation in a circular tetragon, with no-slip or mixed (no-shear-stress) boundary conditions on the two adjacent pore walls and two menisci, is solved by the methods of complex analysis. The velocity distribution is obtained via the Keldysh–Sedov type of singular integrals, and the flow rate is evaluated for several sets of meniscus radii by integrating the velocity over the corresponding tetragons.
Primal heuristics guarantee that feasible, high-quality solutions are provided at an early stage of the solving process, and thus are essential to the success of mixed-integer programming (MIP). By helping prove optimality faster, they allow MIP technology to extend to a wide variety of applications in discrete optimization. This first comprehensive guide to the development and use of primal heuristics within MIP technology and solvers is ideal for computational mathematics graduate students and industry practitioners. Through a unified viewpoint, it gives a unique perspective on how state-of-the-art results are integrated within the branch-and-bound approach at the core of the MIP technology. It accomplishes this by highlighting all the required knowledge needed to push the heuristic side of MIP solvers to their limit and pointing out what is left to do to improve them, thus presenting heuristic approaches for MIP as part of the MIP solving process.
This chapter introduces the notation used in the book and discusses the mixed integer programming (MIP) computational framework in which heuristics are developed, used, and evaluated. The chapter starts by formally definining MIP and presenting the basic complete algorithms to solve it. Then, the more important building block concepts at the core of primal heuristics are presented, as well as the way in which they are incorporated in the MIP framework and their impact.
This chapter reviews the a large family of relatively cheap primal heuristics that generally try to convert infeasible solutions obtained by solving the continuous relaxation of a MIP into feasible solutions. The review is conducted by following three main concepts, namely that of rounding a fractional point to an integer one, that of propagating the logical implication of a decision on a variable to other variables, and that of diving, i.e., sequentially make decisions on variables. The combinations of these concepts are extensively analyzed.
The computational study presented in this chapter analyzes the impact of primal heuristics from different angles. This is done by investigating in which respect primal heuristics have an impact on the performance of a MIP solver, with respect to multiple performance measures.
This chapter presents the primal heuristics in the feasibility pump family. The fundamental idea of all feasibility pump algorithms is to construct two sequences of points that hopefully converge to a feasible solution of a given optimization problem. The points in the first sequence are feasible with respect to the linear programming constraints of the MIP, while those in the second sequence respect the integrality requirements. This basic concept has been developed in many ways in the literature, and this chapter gives an exhaustive overview of the resulting algorithms.
This chapter concerns the vast family of large neighborhood search primal heuristics. These are local search heuristics that generally assume the knowledge of one or more feasible MIP solutions and explore "large" neighborhoods in the attempt to improve the incumbent, i.e., the best feasible solution computed so far by the MIP algorithm. A neighborhood is large if, in general, it cannot be explored by complete enumeration, so the various techniques developed for defining those neighborhoods and exploring them are discussed.
This chapter discusses the extension of many primal heuristics developed for MIP to mixed integer nonlinear programming, a larger and even more challenging class of mathematical optimization problems that contains MIP. The importance of primal heuristics for this area is highlighted and some novel ideas originated from specifically considering mixed integer nonlinear programs are also reviewed.
We consider a pair of identical theta neurons in the active regime, each coupled to the other via a delayed Dirac delta function. The network can support periodic solutions and we concentrate on solutions for which the neurons are half a period out of phase with one another, and also solutions for which the neurons are perfectly synchronous. The dynamics are analytically solvable, so we can derive explicit expressions for the existence and stability of both types of solutions. We find two branches of solutions, connected by symmetry-broken solutions which arise when the period of a solution as a function of delay is at a maximum or a minimum.
This chapter discusses some primal heuristics that do not necessarily belong with the mainstream methods that have been implemented in the MIP solvers but are interesting either for historical reasons (first attempts of the MIP community to devise heuristic solutions within a general MIP scheme) or because they combine many of the ingredients that are at the core of this book.
The integration of machine learning models within MIP computation has been an exciting research trend in the last decade. This chapter reviews the use of such models in conjunction with primal heuristics for MIP.