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 objective of this paper is the construction of a branch-and-bound algorithm for computing minimum cost flows in capacitated networks when the cost of passing a flow over an arc is concave. The ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback