|
Camargue
|
Exact primal blossom separation as per Letchford and Lodi's algorithm. More...
#include <blossoms.hpp>

Public Member Functions | |
| ExBlossoms (const std::vector< Graph::Edge > &_edges, const LP::ActiveTour &active_tour_, Data::SupportGroup &s_dat, CutQueue< ex_blossom > &_blossom_q) | |
| bool | find_cuts () |
Private Attributes | |
| const std::vector< Graph::Edge > & | edges |
| const LP::ActiveTour & | active_tour |
| Data::SupportGroup & | supp_data |
| CutQueue< ex_blossom > & | blossom_q |
Exact primal blossom separation as per Letchford and Lodi's algorithm.
1.8.11