COIN/BCP
From MaRDI portal
Cited in
(11)- Mosel
- BonsaiG
- The time dependent traveling salesman problem: polyhedra and algorithm
- Faster MIP solutions via new node selection rules
- Dantzig-Wolfe decomposition and branch-and-price solving in G12
- Solving a class of stochastic mixed-integer programs with branch and price
- Computational experience with a software framework for parallel integer programming
- A branch-and-price algorithm and new test problems for spectrum auctions
- Optimal design of the seasonal influenza vaccine with manufacturing autonomy
- Constraint programming-based column generation
- Constraint programming-based column generation
This page was built for software: COIN/BCP
