Fairness in ambulance routing for post disaster management

Central European Journal of Operations Research - Disaster management generally includes the post-disaster stage, which consists of the actions taken in response to the disaster damages. These...     

Examining the balance between efficiency and resilience in closed-loop supply chains

Central European Journal of Operations Research - We study a hybrid system where the demand of customers can be satisfied by both manufacturing new products and remanufacturing used products. To...     

Correction to: Preface

Foundations of Computational Mathematics -     

Complexes of copper(II) with sugar α-amino acids as ligands

Summary Complexes of Cu^II with 2-(benzylamino)-2-deoxy-d-glycero-d-talo heptonic acid (BnMa) and 2-(benzylamino)-2-deoxy-d-glycero-l-gluco heptonic acid (BnGa) were prepared and characterized by elemental analysis, thermal data, i.r., electronic and e.s.r. spectra, magnetic susceptibility measurements, and X-ray powder diffraction. The metal:ligand stoichiometry of these complexes is 12 and coordination around Cu^II seems to be octahedral, with the ligands bound through the N atom of the amino group and O atoms of the bridging carboxylate group.     

The crystal structure of eudesma-4(15),7(11)-dien-8α, 12-olide: a sesquiterpene lactone fromTrattinickia rhoifolia Willd

The title compound, formula C₁₅H₂₀O₂, is orthorhombic, P2₁2₁2₁ witha=8.747(2),b=12.025(3),c=12.554(3)Å,Z=4, andD _m =1.32(2)g/ml. The structural analysis shows that the compound corresponds to eudesma-4(15),7(11)-dien-8,12-olide, a sesquiterpene lactone previously isolated fromAster umbellatus but whose crystal structure was unknown.     

A note on packing paths in planar graphs

Seymour (1981) proved that the cut criterion is necessary and sufficient for the solvability of the edge-disjoint paths problem when the union of the supply graph and the demand graph is planar and Eulerian. When only planarity is required, Middendorf and Pfeiffer (1993) proved the problem to be NP-complete. For this case, Korach and Penn (1992) proved that the cut criterion is sufficient for the existence of a near-complete packing of paths. Here we generalize this result by showing how a natural strengthening of the cut criterion yields better packings of paths.Analogously to Seymour's approach, we actually prove a theorem on packing cuts in an arbitrary graph and then the planar edge-disjoint paths case is obtained by planar dualization. The main result is derived from a theorem of Seb (1990) on the structure of ±1 weightings of a bipartite graph with no negative circuits.Research partially supported by the Hungarian National Foundation for Scientific Research Grants OTKA 2118 and 4271.     

Lines of curvature near umbilical points on surfaces immersed in R4

LetM be a compact orientable surface,I:M R⁴ an immersion of classC ^r and a normal unitary smooth vector field. We prove that in the space of pairs (I, ) the family of pairs all whose umbilical points are Darbouxian is generic.     

Selberg's inequality in arithmetic progressions. II

We obtain an elementary derivation for Selberg's formula related to the function ψ _{r, k} ^* (x; q, ?) for allr, k positive integers.