Camargue
|
Structure for storing blossom inequalities from exact primal separation. More...
#include <cut_structs.hpp>
Public Member Functions | |
ex_blossom (std::vector< int > &_handle, int _cut_edge, double _val) | |
Public Attributes | |
std::vector< int > | handle |
int | cut_edge |
double | cut_val |
Structure for storing blossom inequalities from exact primal separation.
This structure stores blossom inequalities found by the exact primal separation algorithm of Letchford-Lodi in Primal Separation Algorithms Revisited.