6 #ifndef CMR_SEPARATOR_H 7 #define CMR_SEPARATOR_H 28 Separator(
const std::vector<Graph::Edge> &core_edges_,
48 bool local_sep(
int chunk_sz,
bool sphere);
51 LPcutList &fastblossom_q() {
return fast2m_q; }
52 LPcutList &blockcomb_q() {
return blkcomb_q; }
57 LPcutList &connect_cuts_q() {
return connect_q; }
58 LPcutList &exact_sub_q() {
return exsub_q; }
63 LPcutList &local_cuts_q() {
return local_q; }
73 const std::vector<Graph::Edge> &core_edges;
80 std::vector<int> perm_elist;
82 const int random_seed;
Support graph data for an LP solution.
Definition: datagroups.hpp:174
Separator(const std::vector< Graph::Edge > &core_edges_, const LP::ActiveTour &active_tour_, Data::SupportGroup &suppdata, Data::KarpPartition &kpart, int seed)
Construct a Separator using problem data.
Definition: separator.cpp:29
Representing cuts outside the LP solver.
Header for classes/structures/functions to work with graphs.
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
void set_TG()
Construct the TourGraph TG.
Definition: separator.cpp:49
Class template for queue of cuts in some form.
Definition: process_cuts.hpp:30
bool filter_primal
The desired filter_primal value for ConcordeSeparator inheritors.
Definition: separator.hpp:66
Karp partitions of TSP instances.
Information about the active tour in a CoreLP.
Definition: active_tour.hpp:30
Structures for storing and processing cuts.
Management of basic separation routines.
Definition: separator.hpp:25
The namespace for this project.
Definition: abc_nodesel.hpp:20
Class for computing and storing Karp partitions.
Definition: karp.hpp:30
Monitoring the active tour in the solution process.
Wrapper to Concorde CCtsp_lpgraph for pricing cuts at tours.
Definition: cc_lpcuts.hpp:28