Smartphone-Based Colorimetric Method to Quantify Iron Concentration and to Determine the Nanoparticle Size from Suspensions of Magnetic Nanoparticles

Advanced uses of smartphones are changing lifestyles, and may have a great impact in materials science in the near future. In this work, the use of these devices to develop fast, simple, and cheap methods to characterize magnetic nanoparticle suspensions is tested. A series of dilutions of a wide library of magnetic nanoparticles, composed of iron oxide materials in the range between 3 and 43 nm, with two different shapes and four different coatings is prepared. The colloid color is analyzed using the RGB (red, green, blue) color model. Ratios of these parameters are correlated with the suspension iron concentration and with the nanoparticles average size. A linear relationship between the color (in particular the G/R ratio) and both the colloid iron content and the particles size is found. The link between these parameters allows the development of two new methods to determine either the concentration or the particle size of magnetic nanoparticle suspensions just by acquiring images from suspensions of iron oxide magnetic nanoparticles with a smartphone.     

The Concept of Proper Solution in Linear Programming

In this paper, we study the optimal solutions of a dual pair of linear programming problems that correspond to the proper equilibria of their associated matrix game. We give conditions ensuring the existence of such solutions, show that they are especially robust under perturbation of right-hand-side terms, and describe a procedure to obtain them.     

Olga Nikolajevna Bondareva 1937–1991

Obituary

Olga Nikolajevna Bondareva 1937–1991     

Continuous production of inorganic magnetic nanocomposites for biomedical applications by laser pyrolysis

Magnetic composites of Fe-based nanoparticles encapsulated in carbon/silica (C/SiO₂@Fe) or carbon (C@Fe) matrices were prepared by laser-induced pyrolysis of aerosols. The powders were dispersed in aqueous solutions at pH 7 resulting in biocompatible colloidal dispersions with a high resistance to biodegradation. Structural and magnetic properties and the suitability of aqueous dispersions as contrast agent for MRI were analyzed. The results of these characterizations and the NMR relaxivity data are very encouraging for application of laser pyrolysis products in the field of living tissues.     

Center location problems on tree graphs with subtree-shaped customers

We consider the p-center problem on tree graphs where the customers are modeled as continua subtrees. We address unweighted and weighted models as well as distances with and without addends. We prove that a relatively simple modification of Handler’s classical linear time algorithms for unweighted 1- and 2-center problems with respect to point customers, linearly solves the unweighted 1- and 2-center problems with addends of the above subtree customer model. We also develop polynomial time algorithms for the p-center problems based on solving covering problems and searching over special domains.     

Multicriteria Planar Ordered Median Problems

In this paper, we deal with the determination of the entire set of Pareto solutions of location problems involving Q general criteria. These criteria include median, center, or centdian objective functions as particular instances. We characterize the set of Pareto solutions of all these multicriteria problems for any polyhedral gauge. An efficient algorithm is developed for the planar case and its complexity is established. Extensions to the nonconvex case are also considered. The proposed approach is more general than previously published approaches to multicriteria location problems.The research of the third and fourth authors was partially supported by Grants BFM2001-2378, BFM2001-4028, BFM2004-0909, and HA2003-0121.     

A specialized branch & bound & cut for Single-Allocation Ordered Median Hub Location problems

The Single-Allocation Ordered Median Hub Location problem is a recent hub model introduced by Puerto et al. (2011) [32] that provides a unifying analysis of the class of hub location models. Indeed, considering ordered objective functions in hub location models is a powerful tool in modeling classic and alternative location paradigms, that can be applied with success to a large variety of problems providing new distribution patterns induced by the different users’ roles within the supply chain network. In this paper, we present a new formulation for the Single-Allocation Ordered Median Hub Location problem and a branch-and-bound-and-cut (B&B&Cut) based algorithm to solve optimally this model. A simple illustrative example is discussed to demonstrate the technique, and then a battery of test problems with data taken from the AP library are solved. The paper concludes that the proposed B&B&Cut approach performs well for small to medium sized problems.     

On discrete optimization with ordering

This paper studies discrete optimization problems with ordering requirements. These problems are formulated on general discrete sets in which there exists an ordering on their elements together with a cost function that evaluates each element of a given subset depending on its ordering relative to the remaining elements in the set. It is proven that ordered sequences over the original ground set define an independence system. The simplest such ordering problem, that consists of finding the ordered sequence of maximum weight, and its restriction to sets of a fixed cardinality are studied. In both cases, the polyhedral structure of the corresponding feasible sets is analyzed.