Public Member Functions | |
virtual void | init (subproblem &S) |
virtual status | standard_separation (subproblem &S) |
virtual status | feasible (solution &S) |
Protected Types | |
typedef adjacency_list< vecS, vecS, undirectedS > | Graph |
typedef graph_traits< Graph > | GraphTraits |
typedef GraphTraits::vertex_descriptor | vertex_descriptor |
typedef GraphTraits::edge_descriptor | edge_descriptor |
Protected Member Functions | |
virtual void | construct_separation_graph (ILP_Problem &IP) |
void | printEdge (qelement< Graph > *a, qelement< Graph > *b) |
void | printDecomposition () |
bool | checkBounds (subproblem &S) |
Protected Attributes | |
std::list< qelement< Graph > * > | qm |
Graph | G |
row_map< edge_descriptor > | VM |
SCIL::CUT< Graph > * | scc |
Definition at line 21 of file nonlinear_inst.h.
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.
Reimplemented in SCIL::bool_inst, and SCIL::monomial_inst.
Definition at line 60 of file nonlinear_inst.h.
virtual void SCIL::nonlinear_inst::init | ( | subproblem & | ) | [virtual] |
This function is called before the first LP at the root of the BCP-tree is solved.
Reimplemented from SCIL::sym_constraint.
virtual status SCIL::nonlinear_inst::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.