Using rank-1 lift-and-project closures to generate cuts for 0–1 MIPs, a computational investigation

Various techniques for building relaxations and generating valid inequalities for pure or mixed integer programming problems without special structure are reviewed and compared computationally. Besides classical techniques such as Gomory cuts, Mixed Integer Rounding cuts, lift-and-project and reformulation–linearization techniques, a new variant is also investigated: the use of the relaxation corresponding to the intersection of simple disjunction polyhedra (i.e. the so-called elementary closure of lift-and-project cuts). Systematic comparative computational results are reported on series of test problems including multidimensional knapsack problems (MKP) and MIPLIB test problems. From the results obtained, the relaxation based on the elementary closure of lift-and-project cuts appears to be one of the most promising.     

Multidimensional transonic shocks and free boundary problems for nonlinear equations of mixed type

We establish the existence and stability of multidimensional transonic shocks for the Euler equations for steady potential compressible fluids. The Euler equations, consisting of the conservation law of mass and the Bernoulli law for the velocity, can be written as a second-order, nonlinear equation of mixed elliptic-hyperbolic type for the velocity potential. The transonic shock problem can be formulated into the following free boundary problem: The free boundary is the location of the transonic shock which divides the two regions of smooth flow, and the equation is hyperbolic in the upstream region where the smooth perturbed flow is supersonic. We develop a nonlinear approach to deal with such a free boundary problem in order to solve the transonic shock problem. Our results indicate that there exists a unique solution of the free boundary problem such that the equation is always elliptic in the downstream region and the free boundary is smooth, provided that the hyperbolic phase is close to a uniform flow. We prove that the free boundary is stable under the steady perturbation of the hyperbolic phase. We also establish the existence and stability of multidimensional transonic shocks near spherical or circular transonic shocks.

     

Some new results on superimposed codes

A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc.     

Generalized lattice model of liquid state and its relation to Ginzburg–Landau theory

Basic principles of the generalized lattice model of multicomponent condensed systems are formulated. Short-range parts of interatomic interactions are taken into account by means of the geometric constraints method. Long-range parts of the interactions are taken into account in mean field approximation. The expression for Helmholtz free energy is obtained. A system of integral equations for the equilibrium distributions of components is derived. The asymptotic properties of its solutions are investigated. Moment expansion of interatomic interactions and localization of integral terms in free energy is obtained. A Ginzburg–Landau-like functional of free energy is derived.     

Free probability and the von Neumann algebrasof free groups

This short note summarizes the circumstances of the birth of free probability theory andsome of the recent achievements.     

Simulation of viscous water column collapse using adapting hierarchical grids

An adaptive hierarchical grid‐based method for predicting complex free surface flows is used to simulate collapse of a water column. Adapting quadtree grids are combined with a high‐resolution interface‐capturing approach and pressure‐based coupling of the Navier–Stokes equations. The Navier–Stokes flow solution scheme is verified for simulation of flow in a lid‐driven cavity at Re=1000. Two approaches to the coupling of the Navier–Stokes equations are investigated as are alternative face velocity and hanging node interpolations. Collapse of a water column as well as collapse of a water column and its subsequent interaction with an obstacle are simulated. The calculations are made on uniform and adapting quadtree grids, and the accuracy of the quadtree calculations is shown to be the same as those made on the equivalent uniform grids. Results are in excellent agreement with experimental and other numerical data. A sharp interface is maintained at the free surface. The new adapting quadtree‐based method achieves a considerable saving in the size of the computational grid and CPU time in comparison with calculations made on equivalent uniform grids. Copyright © 2005 John Wiley & Sons, Ltd.     

An investigation on planar dielectric light collectors for illumination and solar energy applications

In this paper the performances of inhomogeneous dielectric slabs as solar light collectors for both illumination and solar energy applications are analysed.     

Hamiltonian N2‐locally connected claw‐free graphs

A graph G is N₂‐locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent to ν in G induce a connected graph. In 1990, Ryjá?ek conjectured that every 3‐connected N₂‐locally connected claw‐free graph is Hamiltonian. This conjecture is proved in this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005     

Sparse graph certificates for mixed connectivity

We give a short proof for the Mixed Connectivity Certificate Theorem of Even, Itkis and Rajsbaum and provide an upper bound on the edge number of a certificate of local T-mixed connectivity up to k.