This paper develops an algorithm for pure integer programming problems. It first transforms the integer programming problem to an algebraically equivalent Hermite canonical problem, and then employs ...

One formulation of the machine sequencing problem is that of finding a minimaximal path in a disjunctive graph. This paper describes an implicit enumeration procedure that solves the problem by ...

Our research is focused on graph algorithms, from both a theoretical perspective, and a practical perspective motivated by real-world problems in Bioinformatics, such as genome sequencing technologies ...