![]() ![]() | |
![]() ![]() | State of branch-and-cut |
![]() ![]() | |
![]() ![]() | Base model |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | Abstract base class for consequent bounds |
![]() ![]() | Interface between Cbc and Cut Generation Library |
![]() ![]() | Abstract cut modifier base class |
![]() ![]() | Base class for Cbc event handling |
![]() ![]() | Fathom base class |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | Heuristic base class |
![]() ![]() | A class describing the branching decisions that were made to get to the node where a heuristics was invoked from |
![]() ![]() | |
![]() ![]() | Simple Branch and bound class |
![]() ![]() | Information required to recreate the subproblem at this node |
![]() ![]() | |
![]() ![]() | Very simple class for setting parameters |
![]() ![]() | Start and end of CbcModel parameters in parameter vector |
![]() ![]() | This allows the use of the standalone solver in a flexible manner |
![]() ![]() | Structure to hold useful arrays |
![]() ![]() | For gathering statistics |
![]() ![]() | Support the use of a call back class to decide whether to stop |
![]() ![]() | Strategy base class |
![]() ![]() | Abstract base class for `objects' |
![]() ![]() | A class to encapsulate thread stuff |
![]() ![]() | |
![]() ![]() | A class to allow the use of unknown user functionality |
![]() ![]() | |
![]() ![]() | Control variables for a strong branching method |
![]() ![]() | Control variable and prototype for clique cut generator |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | Control variable and prototype for combine heuristic |
![]() ![]() | Array of primal variable values for debugging |
![]() ![]() | Control use of reduced cost fixing prior to B&C |
![]() ![]() | Control variable and prototype for flow cover cut generator |
![]() ![]() | Control variable and prototype for feasibility pump heuristic |
![]() ![]() | Start and end of cbc-generic parameters in parameter vector |
![]() ![]() | Control variable and prototype for Gomory cut generator |
![]() ![]() | Control variable and prototype for greedy cover heuristic |
![]() ![]() | Control variable and prototype for greedy equality heuristic |
![]() ![]() | Control variable and prototype for knapsack cover cut generator |
![]() ![]() | Control variables for local tree |
![]() ![]() | Control variable and prototype for MIR cut generator |
![]() ![]() | Control variable and prototype for odd hole cut generator |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | List of bounds which depend on other bounds |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | Define data for one link |
![]() ![]() | Start and end of OsiSolverInterface parameters in parameter vector |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | Control variable and prototype for probing cut generator |
![]() ![]() | |
![]() ![]() | Control variable and prototype for reduce-and-split cut generator |
![]() ![]() | Control variable and prototype for simple rounding heuristic |
![]() ![]() | Implementation of live set as a heap |
![]() ![]() | Control variable and prototype for Two-MIR cut generator |