qmst_heuristic Class Reference

Inheritance diagram for qmst_heuristic:

[legend]

Collaboration diagram for qmst_heuristic:

[legend]

List of all members.

Public Member Functions
	qmst_heuristic (Graph &G_, var_map< edge_descriptor > &VM_)
int	heuristic (subproblem &S, solution &newSol)

---

Detailed Description

Examples:

Quadratic_Minimum_Spanning_Tree.

Definition at line 20 of file qmst.cc.

---

Member Function Documentation

int qmst_heuristic::heuristic	(	subproblem &	,
		solution &	newSol
	)			[inline, virtual]

this function is called after each solution of an LP, if the solution which was found is not feasible.

Reimplemented from SCIL::primal_heuristic.

Definition at line 30 of file qmst.cc.

References SCIL::ILP_Problem::extendSolution(), SCIL::solution::set_value(), and SCIL::subproblem::value().

---

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

• qmst.cc