An exact branch-and-bound procedure for the quadratic-assignment problem

The quadratic-assignment problem is a difficult combinatorial problem which still remains unsolved. In this study, an exact branch-and-bound procedure, which is able to produce optimal solutions for problems with twelve facilities or less, is developed. The method incorporates the concept of stepped fathoming to reduce the effort expended in searching the decision trees. Computational experience with the procedure is presented.     

Relative performance of novel blast wave mitigation system to conventional system based on mitigation percent criteria

Recent researches focused on developing robust blast load mitigation systems due to the threats of terrorist attacks. One of the main embraced strategies is the structural systems that use mitigation techniques. They are developed from a combination of structural elements and described herein as conventional systems. Among the promising techniques is that redirect the waves propagation through hollow tubes. The blast wave propagation through tubes provides an efficient system since it combines many blast wave phenomena, such as reflection, diffraction, and interaction. In this research, a novel blast load mitigation system, employed as a protection fence, is developed using a technique similar to the technique of the bent tube in manipulating the shock-wave. The relative performance of the novel system to the conventional system is evaluated based on mitigation percent criteria. Performances of both systems are calculated through numerical simulation. The proposed novel system proved to satisfy high performance in mitigating the generated blast waves from charges weight up to 500 kg TNT at relatively small standoff distances (5 m and 8 m). It mitigates at least 94％ of the blast waves, which means that only 6％ of that blast impulse is considered as the applied load on the targeted structure.     

Radar pulse interleaving for multi‐target tracking

In a multifunction radar, the maximum number of targets that can be managed or tracked is an important performance measure. Interleaving algorithms developed to operate radars exploit the dead‐times between the transmitted and the received pulses to allocate new tracking tasks that might involve transmitting or receiving pulses, thus increasing the capacity of the system. The problem of interleaving N targets involves a search among N! possibilities, and suboptimal solutions are usually employed to satisfy the real‐time constraints of the radar system. In this paper, we present new tight 0–1 integer programming models for the radar pulse interleaving problem and develop effective solution methods based on Lagrangian relaxation techniques. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.