Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Mancini, E., Marcarelli, S., Ritrovato, P., Vasil’ev, I., Villano, U.: A Grid-Aware Branch, Cut and Price Implementation. In: Di Martino, B., Kranzlmüller, D., Dongarra, J. (eds.) EuroPVM/MPI 2005. LNCS, vol. 3666, pp. 38–47. Springer, Heidelberg (2005)
Ferreira, L., Jacob, B., Slevin, S., Brown, M., Sundararajan, S., Lepesant, J., Bank, J.: Globus Toolkit 3.0 Quick Start. IBM (2003)
Karonis, N., Toonen, B., Foster, I.: MPICH-G2: A Grid-Enabled Implementation of the Message Passing Interface. J. of Parallel and Dist. Comp. 63, 551–563 (2003)
Vasil’ev, I., Avella, P.: PBC: A parallel branch-and-cut framework. In: Proc. of 35th Conference of the Italian Operations Res., Society, Lecce, Italy, vol. 138 (2004)
Ralphs, T., Ladanyi, L., Saltzman, M.: Parallel Branch, Cut, and Price for Large-Scale Discrete Optmization. Mathematical Programming 98, 253–280 (2003)
Margot, F.: BAC: A BCP Based Branch-and-Cut Example (2003)
Cordiery, C., Marchandz, H., Laundyx, R., Wolsey, L.: bc-opt: a Branch-and-Cut Code for Mixed Integer Programs. Mathematical Programming (86), 335–354 (1999)
Ralphs, T., Ladanyi, L.: COIN/BCP User’s Manual (2001), http://www.coin-or.org/Presentations/bcp-man.pdf
Globus Alliance: WS GRAM: Developer’s Guide (2005), http://www-unix.globus.org/toolkit/docs/3.2/gram/ws/developer
Papadopoulos, P.M., Katz, M.J., Bruno, G.: NPACI Rocks: tools and techniques for easily deploying manageable Linux clusters. Concurrency and Computation: Practice and Experience 15, 707–728 (2003)
Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P.: An updated mixed integer programming library MIPLIB 3.0. Optima 58, 12–15 (1998)
Eckstein, J., Phillips, C., Hart, W.: Pico: An object-oriented framework for parallel branch and bound. Technical report, Rutgers University, Piscataway, NJ (2000)
Linderoth, J.: Topics in Parallel Integer Optimization. PhD thesis, School of Industrial and Systems Engineering, Georgia Inst. of Tech., Atlanta, GA (1998)
Chen, Q., Ferris, M.C.: Fatcop: A fault tolerant condor-pvm mixed integer programming solver. Technical report, University of Wisconsin CS Department Technical Report 99-05, Madison, WI (1999)
Chen, Q., Ferris, M., Linderoth, J.: Fatcop 2.0: Advanced features in an opportunistic mixed integer programming solver. Annals of Op. Res. (103), 17–32 (2001)
Shinano, Y., Higaki, M., Hirabayashi, R.: Control schemas in a generalized utility for parallel branch and bound. In: Proc. of the 1997 Eleventh International Parallel Processing Symposium, IEEE Computer Society Press, Los Alamitos (1997)
Tschoke, S., Polzer, T.: Portable Parallel Branch-And-Bound Library PPBB-Lib User Manual. In: Department of computer science Univ. of Paderborn (1996)
Ralphs, T.K., Ladanyi, L., Saltzman, M.J.: A library hierarchy for implementing scalable parallel search algorithms. J. Supercomput. 28(2), 215–234 (2004)
Goux, J., Kulkarni, S., Yoder, M., Linderoth, J.: An enabling framework for master-worker applications on the computational grid. In: HPDC 2000: Proceedings of the Ninth IEEE International Symposium on High Performance Distributed Computing (HPDC 2000), vol. 43, IEEE Computer Society, Los Alamitos (2000)
Park, K., Park, S., Kwon, O., Park, H.: MPICH-GP: A Private-IP-Enabled MPI Over Grid Environments. In: Cao, J., Yang, L.T., Guo, M., Lau, F. (eds.) ISPA 2004. LNCS, vol. 3358, pp. 469–473. Springer, Heidelberg (2004)
Velusamy, V., Bangalore, P., Raman, P.: Communication strategies for private-ip-enabled interoperable message passing across grid environments. In: Proc. of First International Workshop on Networks for Grid Applications (2004), http://www.broadnets.org/2004/workshop-papers/Gridnets/Velusamy_V.pdf
Das, D., Sabharwal, R., Saraswati, S., Anantharaman, P.N., Oh, J.: A network architecture for enabling execution of mpi applications on the grid. International Journal of Information Technology 11(4), 74–83 (2004)
Heymann, E., Senar, M.A., Fernández, E., Fernández, A., Salt, J.: Managing MPI Applications in Grid Environments. In: Dikaiakos, M.D. (ed.) AxGrids 2004. LNCS, vol. 3165, pp. 42–50. Springer, Heidelberg (2004)
Choi, S., Park, K., Han, S., Park, S., Kwon, O., Kim, Y., Park, H.: An nat-based communication relay scheme for private-ip-enabled mpi over grid environments. In: International Conference on Computational Science, pp. 499–502 (2004)
Chen, C., Schmidt, B.: Performance analysis of computational biology applications on hierarchical grid systems. In: CCGRID, pp. 426–433. IEEE Computer Society, Los Alamitos (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marcarelli, S., Mancini, E.P., Villano, U. (2006). Computational Experience with Branch, Cut and Price Algorithms in Grid Environments. In: Min, G., Di Martino, B., Yang, L.T., Guo, M., Rünger, G. (eds) Frontiers of High Performance Computing and Networking – ISPA 2006 Workshops. ISPA 2006. Lecture Notes in Computer Science, vol 4331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11942634_14
Download citation
DOI: https://doi.org/10.1007/11942634_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49860-5
Online ISBN: 978-3-540-49862-9
eBook Packages: Computer ScienceComputer Science (R0)