Back to SYMPHONY Home Page
Next: The Tree Manager Process
Up: Parallelizing Branch and Cut
Previous: The Cut Generator Process
The linear programming (LP) process is the most complex and
computationally intensive of the five processes. Its job is to perform
the bounding and branching operations. These operations
are, of course, central to the performance of the algorithm.
Functions Performed by the Linear Programming Process
- Inform the tree manager when a new subproblem is needed.
- Receive a subproblem. Process the subproblem in conjunction
with the cut generator and the cut pool.
- If necessary, choose a branching object and send its
description back to the tree manager.