CMR::Sep::SimpleDP Class Reference

Separating primal simple domino parity inequalities. More...

#include <simpleDP.hpp>

Collaboration diagram for CMR::Sep::SimpleDP:

Public Member Functions
	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. More...
bool	find_cuts ()
	Separator invocation, returns true iff cuts found.

Public Attributes
int	verbose = 0

Private Attributes
CandidateTeeth	candidates
Data::KarpPartition &	kpart
CutQueue< dominoparity > &	dp_q
const int	random_seed

Detailed Description

Separating primal simple domino parity inequalities.

Constructor & Destructor Documentation

CMR::Sep::SimpleDP::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.

Constructs a separator from a core LP graph and LP solution.

Parameters

[in]	graph_dat	the info of the core edge set/graph.
[in]	_kpart	the KarpPartition for separating over partitioned DPwitness graphs.
[in]	supp_dat	the SupportGroup for the current LP solution.
[in]	_dp_q	the CutQueue where all found cuts will be stored.

---

The documentation for this class was generated from the following files:

• includes/simpleDP.hpp
• source/simpleDP.cpp