Approximation of min–max and min–max regret versions of some combinatorial optimization problems

This paper investigates, for the first time in the literature, the approximation of min–max (regret) versions of classical problems like shortest path, minimum spanning tree, and knapsack. For a constant number of scenarios, we establish fully polynomial-time approximation schemes for the min–max versions of these problems, using relationships between multi-objective and min–max optimization. Using dynamic programming and classical trimming techniques, we construct a fully polynomial-time approximation scheme for min–max regret shortest path. We also establish a fully polynomial-time approximation scheme for min–max regret spanning tree and prove that min–max regret knapsack is not at all approximable. For a non-constant number of scenarios, in which case min–max and min–max regret versions of polynomial-time solvable problems usually become strongly NP-hard, non-approximability results are provided for min–max (regret) versions of shortest path and spanning tree.     

Comparing the Spanish and the discriminatory auction formats: A discrete model with private information

The Spanish Treasury is the only Treasury in the world that uses a hybrid system of discriminatory and uniform price auctions to sell government debt: winning bidders pay their bid price for each unit if this is lower than the weighted average price of winning bids (WAP), and pay the WAP otherwise. Following Gordy [Gordy, M., 1996. Multiple bids in a multiple-unit common-value auction. Board of Governors of the Federal Reserve System], we model the Spanish auction as a common value auction of multiple units with private information, allowing for multiple bids. Numerical analysis shows that bidders spread their bids more in the Spanish than in the discriminatory auction and bid higher for the first unit, and that the expected seller’s revenue is higher in the Spanish than in the discriminatory auction within a reasonable set of parameter values.     

Efficient algorithms for decomposing graphs under degree constraints

Stiebitz [Decomposing graphs under degree constraints, J. Graph Theory 23 (1996) 321-324] proved that if every vertex v in a graph G has degree d(v)?a(v)+b(v)+1 (where a and b are arbitrarily given nonnegative integer-valued functions) then G has a nontrivial vertex partition (A,B) such that d_A(v)?a(v) for every v∈A and d_B(v)?b(v) for every v∈B. Kaneko [On decomposition of triangle-free graphs under degree constraints, J. Graph Theory 27 (1998) 7-9] and Diwan [Decomposing graphs with girth at least five under degree constraints, J. Graph Theory 33 (2000) 237-239] strengthened this result, proving that it suffices to assume d(v)?a+b (a,b?1) or just d(v)?a+b-1 (a,b?2) if G contains no cycles shorter than 4 or 5, respectively.The original proofs contain nonconstructive steps. In this paper we give polynomial-time algorithms that find such partitions. Constructive generalizations for k-partitions are also presented.     

An improved scheme for accelerating the convergence of the simulated annealing algorithm applied to real world problems

When formulated in mathematical terms, the problem of zoning a protected natural area subject to both box and spatial constraints results in a large combinatorial optimization problem belonging to the NP-hard class. These facts suggest the need to apply a heuristic approach. In this contribution a new proposal to decrease the control parameter, known as temperature, in the simulated annealing algorithm is presented. The strategy is based on that proposed by Lundy and Mees [4], and developed in order to decrease the running time of the algorithm applied to large scale problems. When applied to solving small-size simulated problems, results were indistinguishable from those obtained via an exact, enumerative method. A coarse-scale zoning of Talampaya National Park (Argentina) rendered maps remarkably similar to those produced by subject area experts using a non-quantitative consensus-seeking approach. Results are encouraging and show particular potential for the periodical update of zoning of protected natural areas. Such a capability is crucial for application in developing countries where both human and financial resources are usually scarce but still critical for updating zoning and management plans. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Fourier-Mukai transforms for Gorenstein schemes

We extend to singular schemes with Gorenstein singularities or fibered in schemes of that kind Bondal and Orlov's criterion for an integral functor to be fully faithful. We also prove that the original condition of characteristic zero cannot be removed by providing a counterexample in positive characteristic. We contemplate a criterion for equivalence as well. In addition, we prove that for locally projective Gorenstein morphisms, a relative integral functor is fully faithful if and only if its restriction to each fibre is also fully faithful. These results imply the invertibility of the usual relative Fourier-Mukai transform for an elliptic fibration as a direct corollary.     

A fixed point theorem for a family of mappings in a fuzzy metric space

In this paper we give a common fixed point theorem for a family of mappings of a G-complete fuzzy metric space (X, M, *) into itself. From this result we deduce a common fixed point theorem for a family of mappings of a complete metric space (X, d) into itself. Supported by University of Palermo.     

The Lamb-dip spectrum of phosphine: The nuclear hyperfine structure due to hydrogen and phosphorus

For the first time, the hyperfine structure of the rotational J = 1 ← 0 (K = 0) and J = 2 ← 1 (K = 0, 1) transitions of phosphine has been resolved by using microwave spectroscopy. To this purpose, the Lamb-dip technique has been employed. In addition, the J = 3 ← 2 (K = 0, 1, 2) transition has been recorded at Doppler resolution. The present investigation allowed us to provide accurate values for most of the hyperfine constants as well as ground state rotational parameters.     

Experimental and theoretical investigation on pressure-broadening and pressure-shifting of the 22.2 GHz line of water

Since water is a fundamental component of the atmosphere and it is well established that the accuracy of collisional broadening parameters has a crucial influence on reduction of remote sensing data, we decided to investigate the self-, N₂- and O₂-broadening parameters of the J=6_1,6←5_2,3 (22.2 GHz) rotational transition of water in the temperature range 296-338 K. Due to the relevance of this water line, this investigation should be considered of particular interest in monitoring the Earth's atmosphere, and therefore a particular effort has been made in order to reduce instrumental as well as systematic errors. Experimental determinations have also been supported by theoretical calculations.     

First variation formula and conservation laws in several independent discrete variables

This paper sets the scene for discrete variational problems on an abstract cellular complex that serves as discrete model of R^p and for the discrete theory of partial differential operators that are common in the Calculus of Variations. A central result is the construction of a unique decomposition of certain partial difference operators into two components, one that is a vector bundle morphism and other one that leads to boundary terms. Application of this result to the differential of the discrete Lagrangian leads to unique discrete Euler and momentum forms not depending either on the choice of reference on the base lattice or on the choice of coordinates on the configuration manifold, and satisfying the corresponding discrete first variation formula. This formula leads to discrete Euler equations for critical points and to exact discrete conservation laws for infinitesimal symmetries of the Lagrangian density, with a clear physical interpretation.