reformulation_constraint Class Reference
Public Member Functions | |
| reformulation_constraint (ILP_Problem &IP, Graph &G, map< vertex_descriptor, list< int > > &needed_tools, var_map< edge_descriptor > &tour_vars, map< vertex_descriptor, var_map< int > > &tool_vars, int capacity, bool cyclic, vertex_descriptor &home, int num_tools) | |
| virtual void | init (subproblem &S) |
| status | feasible (solution &S) |
| status | standard_separation (subproblem &S) |
Detailed Description
- Examples:
Definition at line 23 of file ToolSwitching.cc.
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 65 of file ToolSwitching.cc.
| virtual void reformulation_constraint::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 61 of file ToolSwitching.cc.
| status reformulation_constraint::standard_separation | ( | subproblem & | ) | [inline, 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 69 of file ToolSwitching.cc.
References SCIL::subproblem::add_basic_constraint().
The documentation for this class was generated from the following file:
