Models and algorithms for fair layout optimization problems

Given a non-convex two-dimensional area and identical rectangular stands, we consider the problem of placing the maximum number of stands in the area, by satisfying a number of operational constraints. We present linear programming models and show the total unimodularity of the matrices associated with their constraint sets. We then give computational results obtained by applying the models to the real-world case of the Beira Mar handcraft fair of Fortaleza (Brazil).     

Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem

We consider the generalization of the classical P||C_max problem (assign n jobs to m identical parallel processors by minimizing the makespan) arising when the number of jobs that can be assigned to each processor cannot exceed a given integer k. The problem is strongly NP-hard for any fixed k > 2. We briefly survey lower and upper bounds from the literature. We introduce greedy heuristics, local search and a scatter search approach. The effectiveness of these approaches is evaluated through extensive computational comparison with a depth-first branch-and-bound algorithm that includes new lower bounds and dominance criteria.     

Metaheuristic algorithms for combinatorial optimization problems

We present the main results in the author’s Ph.D. thesis (Iori 2004), defended at the University of Bologna in April 2004 and supervised by S. Martello. The thesis is written in English and is available from the author upon request. It proposes exact and metaheuristic algorithms for solving some relevant combinatorial optimization problems, with particular emphasis on scheduling, two-dimensional cutting and packing and capacitated vehicle routing. The performance of each algorithm is tested through extensive computational experiments and comparison with other approaches in the literature.Received: 21 September 2004, AMS classification: 90-08, 90C27, 90C59     

PROFLAVINE-SENSITIZED PHOTOOXIDATION OF TRYPTOPHAN AND RELATED PEPTIDES

Abstract— The photodynamic action of proflavine on the amino acids cystine, rnethionine, tyrosine, histidine, tryptophan and related peptides was tested in anhydrous formic and acetic acids. Only rnethionine and tryptophan were found to be photooxidized: the former, whether free or bound in a polypeptide chain, is quantitatively converted to methioninesulphoxide; the latter, when free, is fragmented to several compounds, which may be divided into two main classes: melanines and kynurenine derivatives. Whereas masking the carboxyl group of tryptophan has no effect on the photooxidation products, N-substituted derivatives of tryptophan are converted in high yields to the corre-sponding kynurenine compounds. The possible applications of the method to biologically active polypeptides are discussed.     

BPPLIB: a library for bin packing and cutting stock problems

The bin packing problem (and its variant, the cutting stock problem) is among the most intensively studied combinatorial optimization problems. We present a library of computer codes, benchmark instances, and pointers to relevant articles for these two problems. The library is available at http://or.dei.unibo.it/library/bpplib. The computer code section includes twelve programs: seven are directly downloadable from the library page, while for the remaining five we provide addresses where they can be obtained or downloaded. Some of the codes for which we provide an original C++ implementation need an integer linear programming solver. For such cases, the library provides two versions: one that uses the commercial solver CPLEX, and one that uses the freeware solver SCIP. The benchmark section provides over six thousands instances (partly coming from the literature and partly randomly generated), together with the corresponding solutions. Instances that are difficult to solve to proven optimality are included. The library also includes a BibTeX file of more than 150 references on this topic and an interactive visual tool to manually solve bin packing and cutting stock instances. We conclude this work by reporting the results of new computational experiments on a number of computer codes and benchmark instances.     

Fragmentation of gold projectiles: From evaporation to total disassembly

We have studied the fragmentation of Au projectiles interacting with targets of C, Al and Cu at an incident energy ofE/A=600 MeV. The employed inverse kinematics allowed a nearly complete detection of projectile fragments with chargeZ≧2. The recorded fragmentation events were sorted according to three observables, the multiplicityM _lp of light charged particles, the largest atomic numberZ _max within an event, and a new observable,Z _bound, representing the sum of the atomic numbersZ of all fragments withZ≧2. Using these observables, the impact parameter dependence of the fragmentation process was investigated. For all three targets, a maximum mean multiplicity of 3 to 4 intermediate mass fragments (IMFs) is observed. The corresponding impact parameters range from central collisions for theC target to increasingly peripheral collisions for the heavier targets. It is found that the correlation between the IMF multiplicity andZ _bound, extending from evaporation type processes (largeZ _bound) to the total disassembly of the projectile (smallZ _bound), is independent of the target nucleus. This universal behaviour may suggest an — at least partial — equilibration of the projectile fragment prior to its decay.     

First observation of the doubly charmed baryon Xi(+)(cc)

We observe a signal for the doubly charmed baryon Xi(+)(cc) in the charged decay mode Xi(+)(cc)-->Lambda(+)(c)K-pi(+) in data from SELEX, the charm hadroproduction experiment at Fermilab. We observe an excess of 15.9 events over an expected background of 6.1+/-0.5 events, a statistical significance of 6.3sigma. The observed mass of this state is 3519+/-1 MeV/c(2). The Gaussian mass width of this state is 3 MeV/c(2), consistent with resolution; its lifetime is less than 33 fs at 90% confidence.     

Quantitative model of price diffusion and market friction based on trading as a mechanistic random process

We model trading and price formation in a market under the assumption that order arrival and cancellations are Poisson random processes. This model makes testable predictions for the most basic properties of markets, such as the diffusion rate of prices (which is the standard measure of financial risk) and the spread and price impact functions (which are the main determinants of transaction cost). Guided by dimensional analysis, simulation, and mean-field theory, we find scaling relations in terms of order flow rates. We show that even under completely random order flow the need to store supply and demand to facilitate trading induces anomalous diffusion and temporal structure in prices.