Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.     

Packing into the smallest square: Worst-case analysis of lower bounds

We address the problem of packing a given set of rectangles into the minimum size square. We consider three versions of the problem, arising when the rectangles (i) are squares; (ii) have a fixed orientation; (iii) can be rotated by 90. For each case we study lower bounds, and analyze their worst-case performance ratio. In addition, we evaluate through computational experiments their average performance on instances from the literature.     

pp interactions in P-wave and related topics

The nucleon-antinucleon (NN) annihilation process provides a fertile testing ground for microscopic hadron exchange and/or quark models. TheNN system offers a rich ensemble of annihilation channels, whose relative BRs provide strong constraints on dynamical models. Recent experiments show that values of BRs display a significant dependence onL, S andI. These dynamical selection rules,i.e. the suppression of transitions alloweda priori by conservation of quantum numbers, provide key signatures of the annihilation mechanism, and suggest dynamical content beyond simple statistical or flavour symmetry models.     

Integer linear programming models for 2-staged two-dimensional Knapsack problems

 We are given a unique rectangular piece of stock material S, with height H and width W, and a list of m rectangular shapes to be cut from S. Each shape's type i (i = 1, ..., m) is characterized by a height , a width , a profit , and an upper bound ub _i indicating the maximum number of items of type i which can be cut. We refer to the Two-Dimensional Knapsack (TDK) as the problem of determining a cutting pattern of S maximizing the sum of the profits of the cut items. In particular, we consider the classical variant of TDK in which the maximum number of cuts allowed to obtain each item is fixed to 2, and we refer to this problem as 2-staged TDK (2TDK). For the 2TDK problem we present two new Integer Linear Programming models, we discuss their properties, and we compare them with other formulations in terms of the LP bound they provide. Finally, both models are computationally tested within a standard branch-and-bound framework on a large set of instances from the literature by reinforcing them with the addition of linear inequalities to eliminate symmetries. Received: October 17, 2000 / Accepted: December 19, 2001 Published online: September 27, 2002 Key words. packing – cutting – integer linear programming     

Solvent-dependent host–guest complexation of two homologous merocyanines by a water-soluble calix[8]arene: Spectroscopic analysis and structural calculations

The sulfonated calixarene I₈C₁₂ acts as a host for homologous merocyanines Mc1 and Mc2 in organic solvents, exhibiting neither selectivity towards the guest dyes nor solvent dependence of the complexation equilibria. In water, on the contrary, only the lower homologue, Mc1, is solubilized in the presence of the calixarene. A combination of UV–visible and fluorescence spectroscopic and photophysical analysis and MD structural simulation of the calixarene-dye complexes was employed to account for the observations, and suggests that a radical change in the complexation mode occurs upon moving from an organic to an aqueous environment.     

Thermal analysis study on vaporization of some analgesics. Acetanilide and derivatives

The thermal behaviour of acetanilide (Ac) and two of its analogues, namely the para-ethoxyacetanilide (p-Eto Ac) and the para-bromoacetanilide (p-Br Ac), which are used as analgesics in the pharmaceutical industry was studied with a simultaneous TG/DSC unit. The examined analgesics showed two endothermic DSC peaks due to melting and vaporization. By combining the experimental TG data with the corresponding reference vapour pressure data obtained with the Antoine equation the plot of P versus v was derived. From the slope of this equation the constant k-value was determined for Ac. Then, using the same k-value the vapour pressures of p-Eto Ac and p-Br Ac were determined in the same temperature range. The vaporization enthalpies for all the studied compounds were obtained from different methods and a very good agreement was found. Vaporization follows a zero-order kinetics. The activation energy of vaporization (E_vap) was calculated from the dynamic TG experiments, using the Arrhenius equation.     

Ion chromatography characterization of polysaccharides in ancient wall paintings

Specific programming of automated HPLC systems allows total on-line qualification, validation and stability monitoring using the concept of deferred standards. Setting up such a process for routine analyses in an automated HPLC system requires specific autosampler programming as well as specific monitoring software. With an autosampler, a double injection procedure is programmed, the first introducing the sample, and the second, a few minutes deferred, the deferred control standard. Two additional compounds are therefore added to the sample before and during the chromatographic process: the intemal standard for sample quantification and the deferred standard for system control. Specific methodologies are described of how to obtain classical quantitative analysis information as well as system qualification validation stability information. Experiments were performed to develop specified methodologies to monitor the quality of quantitative analysis during the life of the column by using the deferred standard concept to probe the effects of column ageing on separation characteristics.     

1,2-Oxopalladation versus pi-allyl palladium route. A regioconvergent approach to a key intermediate for cyclopentanoids synthesis. New insights into the Pd(II)-catalyzed lactonization reaction

Regioconvergent synthesis of the key lactone 1 from an equimolar mixture of the two olefins 4 and 5 was achieved by unique Pd(II) chemistry. The synthetic versatility of lactone 1 has been demonstrated in the synthesis of iridoids and of the endo-Corey lactone 2, which is a key intermediate for the F(2)-isoprostane synthesis. Upon exposure of the sodium salts of 4 and 5 to a catalytic amount of Pd(OAc)(2) under oxygen, in the presence of AcOH, an isomeric lactone 12 was obtained in addition to the title compound 1. The Pd(II) lactonization was optimized by fine-tuning all the factors participating in the catalytic cycle: solvent, oxidant, co-oxidant, and Pd(II) source. The Hosokawa's heterobimetallic couple emerged as the catalyst of choice. With a Cu(II)-Pd(II) couple, the redox process was transferred to copper, and the formal oxidation state of palladium remained constant during the reaction. By virtue of this new methodology, lactone 1 was obtained in a rewarding 60% yield, along with isomeric lactone 12 in 30% yield. A detailed mechanistic study was carried out in order to elucidate the formation of lactones 1 and 12. Lactone 1 was formed from either olefin 8 or olefin 10; on the other hand, lactone 12 was formed exclusively from olefin 10. An intramolecular 1,2-acyloxypalladiation was invoked for the transformation of 8 into 1, whereas the pi-allyl complexes 13 and 11 were involved in the transformation of olefin 10 into 12 and 1, respectively.     

Comparison of the sequential simplex method and linear solvent strength theory in HPLC gradient elution optimization of multicomponent flavonoid mixtures

Summary Using a camomile flavonoid extract as the sample and four different reversed-phase partition systems, the ability of the Simplex procedure to produce optimum gradient separation of unknown multicomponent mixtures was checked against the linear solvent strength (LSS) gradient elution theory. On the same partition systems the mean solvent strenghts were measured by experimentally determined logk vs. mobile phase composition plots. These mean solvent strengths are compared to those inferred from the optimum gradients and the usefulness of LSS theory in multicomponent mixture gradient elution optimization is discussed.Dadicated to Prof. Dr. A Liberti on the occasion of his 70th birthday.