Active-constraint variable ordering for faster feasibility of mixed integer linear programs

The selection of the branching variable can greatly affect the speed of the branch and bound solution of a mixed-integer or integer linear program. Traditional approaches to branching variable selection rely on estimating the effect of the candidate variables on the objective function. We present a new approach that relies on estimating the impact of the candidate variables on the active constraints in the current LP relaxation. We apply this method to the problem of finding the first feasible solution as quickly as possible. Empirical experiments demonstrate a significant improvement compared to a state-of-the art commercial MIP solver.     

Unique satisfiability of Horn sets can be solved in nearly linear time

If a Horn set I has a single satisfying truth assignment or model then that model is said to be unique for I. The question of determining whether a unique model exists for a given Horn set I is shown to be solved in O((L)*L) time, where L is the sum of the lengths of the clauses in I and is the inverse Ackermann function. It is also shown that if LA*log (A) where A is the number of distinct proposition letters then unique satisfiability can be determined in O(L) time.     

An efficient palladium catalyzed synthesis of 2-arylbenzothiazoles

A novel and convergent palladium catalyzed synthesis of 2-arylbenzothiazoles has been investigated. The key step in the synthesis is a Suzuki biaryl coupling of 2-bromobenzothiazole with aryl boronic acids to provide a variety of 2-arylbenzothiazole derivatives in good yield. The synthetic utility of this methodology is demonstrated by the synthesis of 2-(4-aminophenyl)-6-methoxybenzothiazole, a PET probe precursor for the in vivo imaging of Alzheimer's disease.     

13C and 1H NMR analysis of the nitration products of 2-amino-4-oxo-(3H)-5-trifluoromethylquinazoline and 2-amino-4-oxo-(3H)-5-fluoroquinazoline

Nitration of 2-amino-4-oxo-(3H)-5-trifluoromethylquinazoline is shown to occur exclusively at C⁶ as determined from an analysis of long range ¹H and ¹⁹F scalar couplings to ring carbons. Nitration of 2-amino-4-oxo-(3H)-5-fluoroquinazoline is found to occur both at C⁶ and C⁸ as evident from an analysis of the ¹⁹F and ¹H couplings of the ring protons.     

Some Experiences with the Teaching of Decision Support Systems to Management Students

There are essentially two schools of thought regarding the function of decision support systems. One is that the main purpose is to support the decision-maker in whatever style of decision-making he or she wishes. The other is that the support, while suiting the decision-maker's individual style, must also be based on an appropriate theoretical paradigm. The work with students of decision support systems reported here suggests that the latter, normative, view is not one which comes naturally to many of the students, even when working on an example where it seemed relatively easy to incorporate. Other conclusions are also presented, relating to the choice of software for decision support system development, the process of teaching about decision support systems, and group formation.     

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.     

On worst-case aggregation analysis for network location problems

Network location problems occur when new facilities must be located on a network, and the network distances between new and existing facilities are important. In urban, regional, or geographic contexts, there may be hundreds of thousands (or more) of existing facilities, in which case it is common to aggregate existing facilities, e.g. represent all the existing facility locations in a zip code area by a centroid. This aggregation makes the size of the problem more manageable for data collection and data processing purposes, as well as for purposes of analysis; at the same time, it introduces errors, and results in an approximating location problem being solved. There seems to be relatively little theory for doing aggregation, or evaluating the results of aggregation; most approaches are based on experimentation or computational studies. We propose a theory that has the potential to improve the means available for doing aggregation.This research was supported in part by the National Science Foundation, Grant No. DDM-9023392.