PICO: An object-oriented framework for parallel branch and bound. This paper describes the design of PICO, a C++ framework for implementing general parallel branch-and-bound algorithms. The PICO framework provides a mechanism for the efficient implementation of a wide range of branch-and-bound methods on an equally wide range of parallel computing platforms. We first discuss the basic architecture of PICO, including the application class hierarchy and the package’s serial and parallel layers. We next describe the design of the serial layer, and its central notion of manipulating subproblem states. Then, we discuss the design of the parallel layer, which includes flexible processor clustering levels and communication rates, various load balancing mechanisms, and a non-preemptive task scheduler running on each processor. We close by describing the application of the package to a simple branch-and-bound method for mixed integer programming, along with computational results on the ASCI Red massively parallel computer.

References in zbMATH (referenced in 26 articles , 1 standard article )

Showing results 1 to 20 of 26.
Sorted by year (citations)

1 2 next

  1. Leoncini, Mauro; Montangero, Manuela; Valente, Paolo: A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF (2019)
  2. Berthold, Timo; Farmer, James; Heinz, Stefan; Perregaard, Michael: Parallelization of the FICO Xpress-Optimizer (2018)
  3. Gurski, Frank; Rethmann, Jochen: Distributed solving of mixed-integer programs with GLPK and Thrift (2018)
  4. Shinano, Yuji; Heinz, Stefan; Vigerske, Stefan; Winkler, Michael: FiberSCIP -- a shared memory parallelization of SCIP (2018)
  5. Derpich, Ivan; Sepúlveda, Juan M.: Accelerating the B&B algorithm for integer programming based on flatness information: an approach applied to the multidimensional knapsack problem (2017)
  6. Eckstein, Jonathan; Hart, William E.; Phillips, Cynthia A.: PEBBL: an object-oriented framework for scalable parallel branch and bound (2015)
  7. Mason, Luke R.; Mak-Hau, Vicky H.; Ernst, Andreas T.: A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning (2015)
  8. Bendjoudi, A.; Melab, N.; Talbi, E-G.: An adaptive hierarchical master-worker (AHMW) framework for grids-application to B&B algorithms (2012) ioport
  9. Dorta, I.; León, C.; Rodríguez, C.: Performance analysis of branch-and-bound skeletons (2010)
  10. Pinar, Ali; Meza, Juan; Donde, Vaibhav; Lesieutre, Bernard: Optimization strategies for the vulnerability analysis of the electric power grid (2010)
  11. Bussieck, Michael R.; Ferris, Michael C.; Meeraus, Alexander: Grid-enabled optimization with GAMS (2009)
  12. Xu, Yan; Ralphs, Ted K.; Ladányi, László; Saltzman, Matthew J.: Computational experience with a software framework for parallel integer programming (2009)
  13. Baravykaitė, M.; Čiegis, R.: An implementation of a parallel generalized branch and bound template (2007)
  14. Baravykaitė, M.; Žilinskas, J.: Implementation of parallel optimization algorithms using generalized branch and bound template (2006)
  15. Dolgov, D. A.; Durfee, E. H.: Resource allocation among agents with MDP-induced preferences (2006)
  16. Ravi, R.; Sinha, Amitabh: Hedging uncertainty: approximation algorithms for stochastic optimization problems (2006)
  17. Baravykaitė, M.; Čiegis, R.; Žilinskas, J.: Template realization of generalized branch and bound algorithm (2005)
  18. Tran Van Hoai: Solving large scale crew pairing problems. (2005)
  19. Dorta, Isabel; Leon, Coromoto; Rodriguez, Casiano: Parallel branch-and-bound skeletons: message passing and shared memory implementations (2004)
  20. Ralphs, T. K.; Ládanyi, L.; Saltzman, M. J.: A library hierarchy for implementing scalable parallel search algorithms (2004)

1 2 next