A Practical Solution to a Cargo Loading Problem at Bethlehem Steel

The optimum assignment of structural steel shapes to rail cars is an important logistical problem in the steel industry. In this paper, we discuss an application at Bethlehem Steel that not only involves weight and dimensional constraints, but also customer unloading constraints. The formulation is a generalized bin packing problem which is solved by modifying and extending the first fit decreasing algorithm. The solution algorithm, SOLID (for Structural Optimal Loading IDentification), has been used extensively for one of Bethlehem's high tonnage customers providing very good practical (implementable) results that achieve the desired goals. Bethlehem has enhanced this approach for use with other customers.     

Exact ground state of the generalized three-dimensional Shastry-Sutherland model

We generalize the Shastry-Sutherland model to three dimensions. By representing the model as a sum of the semidefinite positive projection operators, we exactly prove that the model has exact dimer ground state. Several schemes for constructing the three-dimensional Shastry-Sutherland model are proposed. Received 20 February 2002 / Received in final form 27 May 2002 Published online 17 September 2002     

Construction of equations for classical equilibrium correlation Green's functions on the basis of kinetic equations. II

Moscow Institute of Electronic Engineering. Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 89, No. 1, pp. 132–150, October, 1991.     

Actions by automorphisms of commutative compact groups with a countablefold Lebesgue component in the spectrum

Translated from Matematicheskie Zametki, Vol. 49, No. 2, pp. 14–22, February, 1991.     

Green's temperature functions of massive scalar particles for finite matter density

An explicit expression is obtained for the Green's functions of a massive scalar field for nonnull temperatures and density in the form of a series in powers of m/T. The equivalence of the spectral-geometric approach and the temperature technique of Matsubara and Bernard is demonstrated. Corrections to the Stefan-Boltzmann law are obtained on the basis of the calculated Green's functions. The energy density is calculated in regions of high and low temperatures. The formulas obtained can prove to be useful in the discussion of the phase transition hadrons-quark-gluon plasma.Translated from Izvestiya Vysshikh Uchebnykh Zavedenii, Fizika, No. 7, pp. 32–40, July, 1991.     

A Tabu Search Approach for Delivering Pet Food and Flour in Switzerland

In this paper, we consider a real-life vehicle routeing problem that occurs in a major Swiss company producing pet food and flour. In contrast with usual hypothetical problems, a large variety of restrictions has to be considered. The main constraints are relative to the accessibility and the time windows at customers, the carrying capacities of vehicles, the total duration of routes and the drivers' breaks. To find good solutions to this problem, we propose two heuristic methods: a fast straightforward insertion procedure and a method based on tabu search techniques. Next, the produced solutions are compared with the routes actually covered by the company. Our outcomes indicate that the total distance travelled can be reduced significantly when such methods are used.     

Crystal and molecular structure of bis(2-isotropyliminomethinylphenyl) telluride

Scientific-Research Institute of Physical and Organic Chemistry, Rostov State University. A. N. Nesmeyanov Institute of Heteroorganic Compounds, Academy of Sciences of the USSR. Translated from Zhurnal Strukturnoi Khimii, Vol. 32, No. 3, pp. 104–106, May–June, 1991.     

The Most Critical Path in a PERT Network

The classical PERT approach uses the path with the largest expected duration as the critical path to estimate the probability of completing a project by a given deadline. However, in general, such a path is not the ‘most critical’ path and does not provide the smallest estimate for the probability of completion time. This paper studies the ‘most critical path’ problem and formulates it as an optimal path problem in a deterministic network with a two-attribute fractional objective function. An exact solution approach is presented for the optimal path problem which also gives the solution to the most critical path problem. The illustrative examples as well as our computational results demonstrate that the proposed algorithm provides estimates for the probabilities of completion time that are much more accurate than those of the classical approach.