11 #include "cut_structs.hpp" 22 ExBlossoms(
const std::vector<Graph::Edge> &_edges,
30 const std::vector<Graph::Edge> &edges;
Support graph data for an LP solution.
Definition: datagroups.hpp:174
Exact primal blossom separation as per Letchford and Lodi's algorithm.
Definition: blossoms.hpp:20
Header for classes/structures/functions to work with graphs.
Class template for queue of cuts in some form.
Definition: process_cuts.hpp:30
Information about the active tour in a CoreLP.
Definition: active_tour.hpp:30
Structures for storing and processing cuts.
The namespace for this project.
Definition: abc_nodesel.hpp:20
Monitoring the active tour in the solution process.