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 results.