Camargue
simpleDP.hpp
Go to the documentation of this file.
1 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
7 #include "active_tour.hpp"
8 #include "witness.hpp"
9 #include "tooth.hpp"
10 #include "datagroups.hpp"
11 #include "karp.hpp"
12 #include "process_cuts.hpp"
13 
14 #include <vector>
15 
16 namespace CMR {
17 namespace Sep {
18 
20 class SimpleDP {
21 public:
23  SimpleDP(Data::KarpPartition &_kpart, const LP::ActiveTour &active_tour,
25  int seed);
26 
27  bool find_cuts();
28 
29  int verbose = 0;
30 
31 private:
32  CandidateTeeth candidates;
33  Data::KarpPartition &kpart;
35 
36  const int random_seed;
37 };
38 
39 }
40 }
Support graph data for an LP solution.
Definition: datagroups.hpp:174
bool find_cuts()
Separator invocation, returns true iff cuts found.
Definition: simpleDP.cpp:45
SimpleDP(Data::KarpPartition &_kpart, const LP::ActiveTour &active_tour, Data::SupportGroup &supp_dat, Sep::CutQueue< dominoparity > &_dp_q, int seed)
Construct a separator to separate over partitioned DPwitness graphs.
Definition: simpleDP.cpp:31
Data group structures.
Separating primal simple domino parity inequalities.
Definition: simpleDP.hpp:20
Class template for queue of cuts in some form.
Definition: process_cuts.hpp:30
Karp partitions of TSP instances.
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
Class for computing and storing Karp partitions.
Definition: karp.hpp:30
Definition: tooth.hpp:21
Monitoring the active tour in the solution process.