Violations checker for the separation oracle in the bounded degree minimum spanning tree problem. More...

Public Types
using	Candidate = std::pair< AuxVertex, AuxVertex >

using	CandidateList = std::vector< Candidate >

Public Member Functions
template<typename Problem , typename LP >
const CandidateList &	get_violation_candidates (const Problem &problem, const LP &lp)

template<typename Problem >
Violation	check_violation (Candidate candidate, const Problem &problem)

template<typename Problem , typename LP >
void	add_violated_constraint (Candidate violating_pair, const Problem &problem, LP &lp)

Detailed Description

Violations checker for the separation oracle in the bounded degree minimum spanning tree problem.

Member Function Documentation

template<typename Problem , typename LP >

void paal::ir::bdmst_violation_checker::add_violated_constraint	(	Candidate	violating_pair,
		const Problem &	problem,
		LP &	lp
	)

inline

Adds a violated constraint to the LP.

template<typename Problem >

Violation paal::ir::bdmst_violation_checker::check_violation	(	Candidate	candidate,
		const Problem &	problem
	)

inline

Checks if the given constraint candidate is violated an if it is, returns the violation value and violated constraint ID.

template<typename Problem , typename LP >

const CandidateList& paal::ir::bdmst_violation_checker::get_violation_candidates	(	const Problem &	problem,
		const LP &	lp
	)

inline

Returns an iterator range of violated constraint candidates.

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

include/paal/iterative_rounding/bounded_degree_min_spanning_tree/bounded_degree_mst_oracle.hpp