dcmst_heuristic Class Reference
Inheritance diagram for dcmst_heuristic:
Collaboration diagram for dcmst_heuristic:
Public Member Functions | |
| dcmst_heuristic (Graph &G_, var_map< edge_descriptor > &VM_, map< vertex_descriptor, int > &dc_) | |
| int | heuristic (subproblem &S, solution &newSol) |
Detailed Description
Definition at line 224 of file dcmst.cc.
Member Function Documentation
| int dcmst_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 234 of file dcmst.cc.
References SCIL::solution::save_solution(), SCIL::solution::set_value(), and SCIL::subproblem::value().
The documentation for this class was generated from the following file:
