BCP is a parallel framework for implementing branch, cut, and price algorithms for solving mixed integer programs (MIPs). BCP provides the user with an object-oriented framework that can be used to develop an efficient problem class specific MIP solver without all the implementational effort. involved with implementing a branch and bound framework from scratch.
Keywords for this software
References in zbMATH (referenced in 8 articles )
Showing results 1 to 8 of 8.
- Abeledo, Hernán; Fukasawa, Ricardo; Pessoa, Artur; Uchoa, Eduardo: The time dependent traveling salesman problem: polyhedra and algorithm (2013)
- Gualandi, Stefano; Malucelli, Federico: Constraint programming-based column generation (2013)
- Puchinger, Jakob; Stuckey, Peter J.; Wallace, Mark G.; Brand, Sebastian: Dantzig-Wolfe decomposition and branch-and-price solving in G12 (2011)
- Wojtaszek, Daniel T.; Chinneck, John W.: Faster MIP solutions via new node selection rules (2010)
- Gualandi, Stefano; Malucelli, Federico: Constraint programming-based column generation (2009)
- Xu, Yan; Ralphs, Ted K.; Ladányi, László; Saltzman, Matthew J.: Computational experience with a software framework for parallel integer programming (2009)
- Silva, Eduardo F.; Wood, R. Kevin: Solving a class of stochastic mixed-integer programs with branch and price (2006)
- Günlük, Oktay; Ladányi, Lászlo; De Vries, Sven: A branch-and-price algorithm and new test problems for spectrum auctions (2005)