An implicit enumeration algorithm is developed for the machine sequencing problem. The method is based on the graph-theoretical representation of the problem. The convergence of the algorithm is ...
The problem of enumerating all proper cuts of a linear graph arises in several reliability applications and is usually solved by algebraic algorithms. We present a new algorithm based upon implicit ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback