SCIL::submodular Class Reference
Public Member Functions | |
| submodular (var &v_, var_map< int > &VM_, int n_) | |
| Constructor. | |
| virtual void | init (subproblem &S) |
| status | standard_separation (subproblem &S) |
| status | feasible (solution &Sol) |
| virtual double | value (solution &Sol)=0 |
Public Attributes | |
| var | v |
| var_map< int > & | VM |
| int | n |
| solution | TS |
| double | oldval |
Detailed Description
Definition at line 9 of file submodular.h.
Member Function Documentation
This function is called, if the BCP-System wants to save the solution of the LP-solver as primal solution. If this function if called, it is guaranteed that all interal variabes have integral values in the LP-solution. The function should return either feasible or infeasible. It could also return fathom, preemtion, exception_branch or resolve_immedialtely.
Reimplemented from SCIL::sym_constraint.
Definition at line 31 of file submodular.h.
References SCIL::solution::value().
| virtual void SCIL::submodular::init | ( | subproblem & | ) | [inline, virtual] |
This function is called before the first LP at the root of the BCP-tree is solved.
Reimplemented from SCIL::sym_constraint.
Definition at line 25 of file submodular.h.
| submodular::status submodular::standard_separation | ( | subproblem & | ) | [virtual] |
This function is called if the BCP-System wants to cut of the solution that was found by the LP-solver. It should return either no_cons_found or cons_found. But it is also possible that it returns fathom, preemption, exception_branch, or resolve_immediately.
Reimplemented from SCIL::sym_constraint.
Definition at line 6 of file submodular.cc.
References SCIL::subproblem::add_basic_constraint(), and SCIL::subproblem::value().
The documentation for this class was generated from the following files:
