Cut pool separation.
More...
#include <pool_sep.hpp>
|
| PoolCuts (std::vector< int > &elist, std::vector< double > &ecap, TourGraph &TG, LPcutList &cutq, CCtsp_lpcuts *_pool, int seed) |
|
bool | find_cuts () |
| Search the pool for violated cuts.
|
|
bool | tighten_pool () |
| Try to obtain violated cuts by tightening cuts in the pool.
|
|
bool | find_consec1 (CCtsp_cuttree &tightcuts) |
| Find combs from consecutive ones.
|
|
bool | find_tour_tight () |
| Search the pool just for cuts that are tight at the current tour.
|
|
| CCsepBase (std::vector< int > &supp_elist, std::vector< double > &supp_ecap, TourGraph &_TG, Sep::LPcutList &_cutq) |
|
|
CCtsp_lpcuts * | pool |
|
int | random_seed |
|
The documentation for this class was generated from the following files: