Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems

Roth’s book [Rot06], where many algebraic codes are presented through the prism of alternant codes, con- siders the list-decoding of these codes and shows how to reach the q-ary

Roth in his book [8] considers the list-decoding of alternant codes, and shows how to reach the q-ary Johnson radius τ q (δ), where δ is the minimum distance of the

First, the un- constrained binary quadratic programming (UBQP) problem has been extended to the multiobjective case (mUBQP) which involves an arbitrary number of UBQP

The performance of the designed two-phase local search algorithm (TP-LS) should be impacted by the connect- edness property for the problem under consideration; the more connected

A TABU SEARCH BASED MEMETIC ALGORITHM FOR THE MAXIMUM DIVERSITY PROBLEM Table 6.4: Computational results of TS/MA for Palubeckis

Sportif these de magistere

Many pro- fessionals at all levels, from clinical set- tings to health insurers or public health departments, turn to health services re- search to monitor the effect of local

When considering the instrumental variable versions of the propagator and projector methods, it can be easily concluded, by means of arguments not unlike those given in [29] for