16 #include <unordered_map> 27 const std::vector<Graph::Edge> &core_edges_,
38 bool find_cuts(
Type meta_type);
42 LPcutList &metacuts_q() {
return meta_q; }
45 bool filter_primal =
true;
60 std::unordered_map<Clique, double> clique_vals;
62 using HGitr = std::vector<HyperGraph>::const_iterator;
63 std::vector<HGitr> interest_combs;
67 const std::vector<Graph::Edge> &core_edges;
72 std::vector<int> perm_elist;
Support graph data for an LP solution.
Definition: datagroups.hpp:174
Representing cuts outside the LP solver.
Management of Concorde lpcut_in linked list.
Definition: cc_lpcuts.hpp:56
The external storage of a collection of HyperGraph cuts in a Relaxation.
Definition: hypergraph.hpp:126
Information about the active tour in a CoreLP.
Definition: active_tour.hpp:30
The namespace for this project.
Definition: abc_nodesel.hpp:20
Monitoring the active tour in the solution process.
Wrappers for Concorde cut structures/separators.
Wrapper to Concorde CCtsp_lpgraph for pricing cuts at tours.
Definition: cc_lpcuts.hpp:28