Sciweavers

2 search results - page 1 / 1
» Branch, Cut, and Price: Sequential and Parallel
Sort
View
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
13 years 8 months ago
Branch, Cut, and Price: Sequential and Parallel
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...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
PVM
2005
Springer
13 years 9 months ago
A Grid-Aware Branch, Cut and Price Implementation
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...
Emilio Mancini, Sonya Marcarelli, Pierluigi Ritrov...