Discussion:
Single Source Longest-Path Problem
A longest-path problem can be transformed into a shortest path problem by changing the sign of all weights
Alternatively, the Bellman-Ford algorithm can be transformed into a "longest path" algorithm by changing the initialization and relaxation procedures
Initialization step of the Bellman-Ford algorithm.
Q: Consider the following activity-on-arc project network, where the 12 arcs (arrows) represent the 12 activities (tasks) that must be performed to complete the project and the network displays the order in which the activities need to be performed. The number next to each arc (arrow) is the time required for the corresponding activity. Consider the problem of finding the longest p2th (the largest total time) through thi: network from start- (node 1) to finish (node 9), since the longest path is the critical path. Formulate a. BIP model for this problem.
