Heuristic Solution Methods for the Multilevel Generalized Assignment Problem

The multilevel generalized assignment problem is a problem of assigning agents to tasks where the agents can perform tasks at more than one efficiency level. A profit is associated with each assignment and the objective of the problem is profit maximization. Two heuristic solution methods are presented for the problem. The heuristics are developed from solution methods for the generalized assignment problem. One method uses a regret minimization approach whilst the other method uses a repair approach on a relaxation of the problem. The heuristics are able to solve moderately large instances of the problem rapidly and effectively. Procedures for deriving an upper bound on the solution of the problem are also described. On larger and harder instances of the problem one heuristic is particularly effective.     

A covering construction for packing disjoint copies of the Hoffman‐Singleton graph into K50

In this note we show how coverings induced by voltage assignments can be used to produce packings of disjoint copies of the Hoffman‐Singleton graph into K₅₀. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 408–412, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10049     

A quantum chemical study on structure of 1,2-bis(diphenylphosphinoyl)ethane and phenol cocrystal

The cocrystal of 1,2-bis(diphenylphosphinoyl)ethane (DPPEO) with phenol (1:1) were studied theoretically with AM1, PM3, MNDO and MINDO/3 semi-empirical methods to elucidate its structure. The bond lengths and angles from theoretical studies of molecule DPPEO/phenol (1:1) were found to be as expected. Theoretical results, concerning with intermolecular van der Waals forces in cocrystal, were compared with the previously obtained experimental data and AM1 results were found to be the best fit for bond lengths and angles of DPPEO/phenol.     

工程施工中运输网络优化方案

施工工地运输方案的优化设计可以归结为 :按施工期要求设计运输线路或验证已有线路通行能力 ,计算总线路中影响提高流量的关键路段 ,取得最小费用最大流 .本文运用图论理论这一数学工具把实际问题抽象为有向网络 ,进而建立数学模型 .此方法理论上严密 ,解题步聚直观清晰 ,对水利、公路、水路、铁路等其它运输系统有普遍意义 .     

Assignment of conformation-sensitive near-infrared bands in high-spin ferrous haemoproteins. Low-temperature magnetic circular dichroism data

An assignment of the near-infrared bands in the 600–800 nm spectral region observed in magnetic circular dichroism (MCD) spectra of high-spin ferrous haemoproteins is presented. The assignment is based on a relative energy level scheme for iron d-electrons, a comparison of predicted and measured temperature dependences of MCD intensity, a sign of MCD bands and a group theoretical analysis of allowed transitions. The proposed assignment is consistent with the ∼15-nm red shift of the ∼760 nm band on breakage of the Fe-His bond in deoxy-myoglobin at low pH, with low-temperature photolysis experiments available for CO complexes of several haemoproteins. In accordance with the observations, the intensity of the MCD bands for proteins with a sulphur anion of cysteine as proximal haemligand (cytochrome P450 and chloroperoxidase) is predicted to be diminished by at least one order of magnitude compared to that for proteins with an imidazole of a histidine as a protein-derived haemligand (i.e. myoglobin, haemoglobin and horseradish peroxidase). Received: 4 February 1997 / Accepted: 1 May 1997     

A note on a polynomial time solvable case of the quadratic assignment problem

We identify a class of instances of the Koopmans–Beckmann form of the Quadratic Assignment Problem that are solvable in polynomial time. This class is characterized by a path structure in the flow data and a grid structure in the distance data. Chr18b, one of the test problems in the QAPLIB, is in this class even though this feature of it has not been noticed until now.     

Capacity Constrained Transit Assignment with Common Lines

This paper proposes the use of absorbing Markov chains to solve the capacity constrained transit network loading problem taking common lines into account. The approach handles congested transit networks, where some passengers will not be able to board because of the absence of sufficient space. The model also handles the common lines problem, where choice of route depends on frequency of arrivals. The mathematical formulation of the problem is presented together with a numerical example. This revised version was published online in July 2006 with corrections to the Cover Date.     

光传送网中结合传输损伤的路由和波长分配

在波长路由光网优化设计的过程中考虑了物理传输损伤造成的限制,提出了一种联合优化思路.将光信号在传输过程中的物理损伤作为问题公式的另一维约束,给出了相应的启发式算法,并按照由粗到细的机制对所提出的思路做了相应的评估,同时对负荷平衡问题作了初步的分析.数值结果表明这种算法可以获得与优化值相近的波长需求解,并且能够保证网络的传输性能,其业务分布随着备选路径的增加而趋向均衡.     

Some results from 50 years' research on surface forces

A review is presented about research on surface forces and surface interactions conducted over the past half-century, with some emphasis on the pioneering contributions of the Department of Surface Phenomena at the Institute of Physical Chemistry of the USSR Academy of Sciences.