Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems

A hybrid heuristic method for combinatorial optimization problems is proposed that combines different classical techniques such as tree search procedures, bounding schemes and local search. The proposed method enhances the classic beam search approach by applying to each partial solution corresponding to a node selected by the beam, a further test that checks whether the current partial solution is dominated by another partial solution at the same level of the search tree. If this is the case, the latter solution becomes the new current partial solution. This step allows to partially recover from previous wrong decisions of the beam search procedure and can be seen as a local search step on the partial solution. We present here the application to two well known combinatorial optimization problems: the two-machine total completion time flow shop scheduling problem and the uncapacitated p-median location problem. In both cases the method strongly improves the performances with respect to the basic beam search approach and is competitive with the state of the art heuristics.     

Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem

In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics.     

Territories,corridors, and networks: A biological model for the premodern state

When depicted on maps as homogenous territorial wholes, ancient states are visually summarized as static entities in a way that conceals the highly fluid dynamics of polity formation, maintenance, and growth. Models derived from studies of animal behavior show that “territory” does not consist of an undifferentiated use of the landscape. Instead, the concept of territory can be parsed into a series of resource‐rich nodes linked by corridors of access, surrounded by unutilized regions and boundaries marked at points of competition. Ancient human groups also can be analyzed as having perceived and occupied landscapes through strategies of flexible networks in which nodes and corridors were surrounded by unutilized spaces around which boundaries were selectively identified and defended. This strategy is identifiable in human social groups at different levels of complexity ranging from hunter‐gatherers through ancient chiefdoms and states. © 2007 Wiley Periodicals, Inc. Complexity 12: 28–35, 2007     

Biomagnetic measurements utilising a superparamagnetic marker: a feasibility study

Summary A preliminary study is here reported on a new potential marker for biomagnetic measurements. The marker consists of superparamagnetic polymer microspheres which were detected in the presence of external steady magnetic fields by means of an r.f.-SQUID magnetometer. The particles were prepared in samples differing in the concentration value and immersed in a homogeneous magnetic field of variable intensity. A simple model was taken into account for the distribution of the microspheres in the samples, so that the theoretical values were compared to the marker field values measured by the biomagnetic sensor. The overall sensitivity of the experimental apparatus and the minimum concentration value of the marker were then estimated.     

Weighted approximation of functions on the real line by Bernstein polynomials

The authors give error estimates, a Voronovskaya-type relation, strong converse results and saturation for the weighted approximation of functions on the real line with Freud weights by Bernstein-type operators.     

α-Fe2O3-In2O3 mixed oxide nanoparticles synthesized under hydrothermal supercritical conditions

α-Fe₂O₃-In₂O₃ mixed oxide nanoparticles system has been synthesized by hydrothermal supercritical and postannealing route, starting with (1−x)Fe(NO₃)₃·9H₂O·xIn(NO₃)₃·5H₂O aqueous solution (x=0-1). X-ray diffraction and Mössbauer spectroscopy have been used to study the phase structure and substitutions in the nanosized samples. The concentration regions for the existence of the solid solutions in the α-Fe₂O₃-In₂O₃ nanoparticle system together with the solubility limits of In³⁺ ions in the hematite lattice and of Fe³⁺ ions in the cubic In₂O₃ structure have been evidenced. In general, the substitution level is considerably lower than the nominal concentration x. A justification of the processes leading to the formation of iron and indium phases in the investigated supercritical hydrothermal system has been given.     

R.F. (280 MHz) EPR imaging of extended samples: Apparatus and preliminary results

This paper presents the preliminary results obtained using an Electron Paramagnetic Resonance imaging apparatus operating at 280 MHz. The acquisition technique and the procedure used to obtain the spin density spatial localization are presented and specimen images of extended samples are given. The accuracy of the images and the spatial resolution are also discussed.