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.
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.
In this paper, we derive simple analytical bounds for solutions of $x - \ln x = y -\ln y$, and use them for estimating trajectories following Lotka–Volterra-type integrals. We show how our results give estimates for the Lambert W function as well as for trajectories of general predator–prey systems, including, for example, Rosenzweig–MacArthur equations.
This study explores the dynamics of a simple mechanical oscillator involving a magnet on a spring constrained to an axis; this magnet is additionally subject to the attractive force from a second magnet, which is placed on a parallel offset axis. The moments of both magnets remain aligned. The dynamics of the first magnet is first analysed in isolation for an unforced situation in which the second magnet is static and its position is taken as a parameter. We find codimension-1 saddle-node bifurcations, as well as a codimension-2 cusp bifurcation. The system has a region of bistability which increases in size with increasing force ratio. Next, the parametrically forced situation is considered, in which the second magnet moves sinusoidally. A comprehensive analysis of the forced oscillator behaviour is presented from the dynamical-systems standpoint. The solutions are shown to include periodic, quasiperiodic and chaotic trajectories. Resonances are shown to exist and the effect of weak damping is explored. Layered stroboscopic maps are used to produce cross-sections of the chaotic attractor as the parametric forcing frequency is varied. The strange attractor is found to disappear for a narrow window of forcing frequencies near the natural frequency of the spring.
While constructing mathematical models, scientists usually consider biotic factors, but it is crystal-clear that abiotic factors, such as wind, are also important as biotic factors. From this point of view, this paper is devoted to the investigation of some bifurcation properties of a fractional-order prey–predator model under the effect of wind. Using fractional calculus is very popular in modelling, since it is more effective than classical calculus in predicting the system’s future state and also discretization is one of the most powerful tools to study the behaviour of the models. In this paper, first of all, the model is discretized by using a piecewise discretization approach. Then, the local stability of fixed points is considered. We show using the centre manifold theorem and bifurcation theory that the system experiences a flip bifurcation and a Neimark–Sacker bifurcation at a positive fixed point. Finally, numerical simulations are given to demonstrate our results.
We conduct a theoretical analysis of the performance of $\beta $-encoders. The $\beta $-encoders are A/D (analogue-to-digital) encoders, the design of which is based on the expansion of real numbers with noninteger radix. For the practical use of such encoders, it is important to have theoretical upper bounds of their errors. We investigate the generating function of the Perron–Frobenius operator of the corresponding one-dimensional map and deduce the invariant measure of it. Using this, we derive an approximate value of the upper bound of the mean squared error of the quantization process of such encoders. We also discuss the results from a numerical viewpoint.
We are concerned with the micro-macro Parareal algorithm for the simulation of initial-value problems. In this algorithm, a coarse (fast) solver is applied sequentially over the time domain and a fine (time-consuming) solver is applied as a corrector in parallel over smaller chunks of the time interval. Moreover, the coarse solver acts on a reduced state variable, which is coupled with the fine state variable through appropriate coupling operators. We first provide a contribution to the convergence analysis of the micro-macro Parareal method for multiscale linear ordinary differential equations. Then, we extend a variant of the micro-macro Parareal algorithm for scalar stochastic differential equations (SDEs) to higher-dimensional SDEs.
This study aims to formulate a highly accurate numerical method, specifically a seventh-order Hermite technique with an error term of sixth order, to solve the Fisher and Burgers–Fisher equations. This technique employs a combination of orthogonal collocation on the finite element method and hepta Hermite basis functions. By ensuring continuity of the dependent variable and its first three derivatives across the entire solution domain, it achieves a remarkable level of accuracy and smoothness. The space discretization is handled through the application of hepta Hermite polynomials, while the time discretization is managed by the Crank–Nicholson scheme. The stability and convergence analysis of the scheme are discussed in detail. To validate the accuracy of the proposed technique, three examples are taken. The results obtained from these examples are thoroughly analysed and compared against the exact solutions and reliable data from the existing literature. It is established that the proposed technique is easy to implement and gives better results as compared with existing ones.
Conformal image registration has always been an area of interest among modern researchers, particularly in the field of medical imaging. The idea of image registration is not new. In fact, it was coined nearly 100 years ago by the pioneer D’Arcy Wentworth Thompson, who conjectured the idea of image registration among the biological forms. According to him, several images of different species are related by a conformal transformations. Thompson’s examples motivated us to explore his claim using image registration. In this paper, we present a conformal image registration (for the two-dimensional grey scaled images) along with a penalty term. This penalty term, which is based on the Cauchy–Riemann equations, aims to enforce the conformality.