Parallel branch, cut, and price for large-scale discrete optimization

Ralphs, Ted K.; Ladányi, L.; Saltzman, Matthew J.

doi:10.1007/s10107-003-0404-8

Cited by 50 publications

(33 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Branch, Cut and Price joins the two methods used by Branch and Cut and Branch and Price, producing dynamically both cutting planes and variables [1].…”

Section: Branch Cut and Price Algorithms And Coin/bcp Frameworkmentioning

confidence: 99%

“…SYMPHONY [1] is a parallel framework, similar to COIN/BCP, for solving mixed integer linear programs. COIN/BCP and SYMPHONY are combined in a new solver under development, ALPS [2].…”

Section: Related Workmentioning

confidence: 99%

“…BCP is an implementation of Branch and Bound in which linear programming is used to derive valid bounds during the exploration of the search tree. Even if the parallelization of BCP is considerably more complex than basic Branch and Bound, currently there are many well known parallel BCP implementations, along with frameworks that allow quick development of customized code [1][2][3][4][5][6][7][8].…”

Section: Introductionmentioning

confidence: 99%

“…BCP-G is a customized version of COIN/BCP, an open source framework developed within the IBM COIN-OR project [1]. The original COIN/BCP framework, based on the use of PVM libraries [13], has been provided with a new MPI communication API able to exploit the MPICH-G2 system, a grid-enabled MPI implementation [14,15].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A grid-aware MIP solver: Implementation and case studies

Mancini¹,

Marcarelli²,

Vasilyev³

et al. 2008

Future Generation Computer Systems

View full text Add to dashboard Cite

“…Branch, Cut and Price joins the two methods used by Branch and Cut and Branch and Price, producing dynamically both cutting planes and variables [1].…”

Section: Branch Cut and Price Algorithms And Coin/bcp Frameworkmentioning

confidence: 99%

“…SYMPHONY [1] is a parallel framework, similar to COIN/BCP, for solving mixed integer linear programs. COIN/BCP and SYMPHONY are combined in a new solver under development, ALPS [2].…”

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A grid-aware MIP solver: Implementation and case studies

Mancini¹,

Marcarelli²,

Vasilyev³

et al. 2008

Future Generation Computer Systems

View full text Add to dashboard Cite

“…The developed system is composed of two solvers, BCP-G and Meta-PBC, and of a web portal, SWI-Portal. BCP-G is a customized version of COIN/BCP, an open source framework developed within the IBM COIN-OR project [6]. The original COIN/BCP framework, based on the use of PVM libraries, has been provided with a new MPI communication API able to exploit the MPICH-G2 system, a grid-enabled MPI implementation [7,8].…”

Section: Introductionmentioning

confidence: 99%

A Grid-Aware Branch, Cut and Price Implementation

Mancini

Marcarelli

Ritrovato

et al. 2005

Recent Advances in Parallel Virtual Machine and Message Passing Interface

View full text Add to dashboard Cite

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 consists of two BCP solvers and of an interface portal. After a brief introduction to Branch, Cut and Price optimization algorithms, the system architecture, the solvers and the portal user interface are described. Finally, some of the tests performed and the obtained results are illustrated.

show abstract