A Grid-Aware Branch, Cut and Price Implementation
نویسندگان
چکیده
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.
منابع مشابه
A grid-aware MIP solver: Implementation and case studies
This paper presents a grid-enabled system for solving large-scale mixed integer programming (MIP) problems. The system has been developed using Globus and MPICH-G2, and consists of two solvers and of an interface portal. After a brief introduction to Branch, Cut and Price optimization algorithms, the paper focuses on the system architecture, solvers and portal user interface. The performance of...
متن کاملComputational Experience with Branch, Cut and Price Algorithms in Grid Environments
This paper presents our computational experience with parallel Branch, Cut and Price algorithms in a geographically-distributed grid environment. After a brief description of our framework for solving large-scale optimization problems, we describe the experimental grid environment and the tests performed, presenting the obtained performance
متن کاملThe Design of the Branch - and - Cut SystemABACUSMichael
The software system ABACUS is an object-oriented framework for the implementation of branch-and-cut and branch-and-price algorithms. This paper describes the design of ABACUS including the design principles and the most important classes.
متن کاملThe Design of the Branch-and-cut System Abacus
The software system ABACUS is an object-oriented framework for the implementation of branch-and-cut and branch-and-price algorithms. This paper describes the design of ABACUS including the design principles and the most important classes.
متن کاملUsing Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems
We present a column-generation model and branch-and-price-and-cut algorithm for origin-destination integer multicommodity flow problems. The origin-destination integer multicommodity flow problem is a constrained version of the linear multicommodity flow problem in which flow of a commodity (defined in this case by an origin-destination pair) may use only one path from origin to destination. Br...
متن کامل