12 #include <unordered_map> 22 PoolCuts(std::vector<int> &elist, std::vector<double> &ecap,
24 :
CCsepBase(elist, ecap, TG, cutq), pool(_pool), random_seed(seed) {}
bool find_tour_tight()
Search the pool just for cuts that are tight at the current tour.
Definition: pool_sep.cpp:123
bool attempt_tighten()
Based on the ecap vector, should we attempt tightening.
Definition: pool_sep.cpp:193
Representing cuts outside the LP solver.
Management of Concorde lpcut_in linked list.
Definition: cc_lpcuts.hpp:56
bool find_cuts()
Search the pool for violated cuts.
Definition: pool_sep.cpp:32
bool above_threshold(int num_paths)
Threshold used by PoolCuts::attempt_tighten.
Definition: pool_sep.cpp:188
bool find_consec1(CCtsp_cuttree &tightcuts)
Find combs from consecutive ones.
Definition: pool_sep.cpp:92
Cut pool separation.
Definition: pool_sep.hpp:20
The namespace for this project.
Definition: abc_nodesel.hpp:20
bool tighten_pool()
Try to obtain violated cuts by tightening cuts in the pool.
Definition: pool_sep.cpp:56
Wrappers for Concorde cut structures/separators.
Abstract base class for calling Concorde separation routines.
Definition: cc_lpcuts.hpp:98
Wrapper to Concorde CCtsp_lpgraph for pricing cuts at tours.
Definition: cc_lpcuts.hpp:28