2 search results - page 1 / 1 » Branch, Cut, and Price: Sequential and Parallel |
159
Voted
CCO
2001
Springer
15 years 9 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
118
Voted
PVM
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper presents a grid-enabled system for solving largescale optimization problems. The system has been developed using Globus and MPICH-G2 grid technologies, and con...