Cbc
2.8.12
|
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | Base model |
![]() ![]() | Define a branch class that branches so that it is only satsified if all members have different values So cut is x <= y-1 or x >= y+1 |
![]() ![]() | Define a cut branching class |
![]() ![]() | |
![]() ![]() | Branching decision default class |
![]() ![]() | Branching decision dynamic class |
![]() ![]() | Abstract branching object base class Now just difference with OsiBranchingObject |
![]() ![]() | Define a branch class that branches so that one way variables are fixed while the other way cuts off that solution |
![]() ![]() | Class for control parameters that act on a CbcModel object |
![]() ![]() | Branching object for cliques |
![]() ![]() | Branching object for unordered cliques |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | Abstract base class for consequent bounds |
![]() ![]() | OsiRowCut augmented with bookkeeping |
![]() ![]() | Cut branching object |
![]() ![]() | Interface between Cbc and Cut Generation Library |
![]() ![]() | Abstract cut modifier base class |
![]() ![]() | Simple cut modifier base class |
![]() ![]() | Dummy branching object |
![]() ![]() | Simple branching object for an integer variable with pseudo costs |
![]() ![]() | Base class for Cbc event handling |
![]() ![]() | Fathom base class |
![]() ![]() | FathomDynamicProgramming class |
![]() ![]() | |
![]() ![]() | General Branching Object class |
![]() ![]() | Class for consequent bounds |
![]() ![]() | Define a follow on class |
![]() ![]() | Information required to recreate the subproblem at this node |
![]() ![]() | |
![]() ![]() | Define a catch all class |
![]() ![]() | Class for cbc-generic control parameters |
![]() ![]() | Heuristic base class |
![]() ![]() | Crossover Search class |
![]() ![]() | |
![]() ![]() | Dive class |
![]() ![]() | DiveCoefficient class |
![]() ![]() | DiveFractional class |
![]() ![]() | DiveGuided class |
![]() ![]() | DiveLineSearch class |
![]() ![]() | DivePseudoCost class |
![]() ![]() | DiveVectorLength class |
![]() ![]() | Heuristic - just picks up any good solution |
![]() ![]() | Feasibility Pump class |
![]() ![]() | Greedy heuristic classes |
![]() ![]() | |
![]() ![]() | Greedy heuristic for SOS and L rows (and positive elements) |
![]() ![]() | Just One class - this chooses one at random |
![]() ![]() | LocalSearch class |
![]() ![]() | Naive class a) Fix all ints as close to zero as possible b) Fix all ints with nonzero costs and < large to zero c) Put bounds round continuous and UIs and maximize |
![]() ![]() | A class describing the branching decisions that were made to get to the node where a heuristic was invoked from |
![]() ![]() | |
![]() ![]() | Partial solution class If user knows a partial solution this tries to get an integer solution it uses hotstart information |
![]() ![]() | LocalSearch class |
![]() ![]() | |
![]() ![]() | LocalSearch class |
![]() ![]() | LocalSearch class |
![]() ![]() | LocalSearch class |
![]() ![]() | LocalSearch class |
![]() ![]() | Define an idiotic idea class |
![]() ![]() | Simple branching object for an integer variable |
![]() ![]() | Simple branching object for an integer variable with pseudo costs |
![]() ![]() | Unordered Clique Branching Object class |
![]() ![]() | Lotsize class |
![]() ![]() | Lotsize branching object |
![]() ![]() | |
![]() ![]() | Simple Branch and bound class |
![]() ![]() | Information required while the node is live |
![]() ![]() | Information required to recreate the subproblem at this node |
![]() ![]() | Define an n-way class for variables |
![]() ![]() | N way branching Object class |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | Class for control parameters that act on a OsiSolverInterface object |
![]() ![]() | This is for codes where solver needs to know about CbcModel Seems to provide only one value-added feature, a CbcModel object |
![]() ![]() | Very simple class for setting parameters |
![]() ![]() | Holds information for recreating a subproblem by incremental change from the parent |
![]() ![]() | Rounding class |
![]() ![]() | |
![]() ![]() | Heuristic - just picks up any good solution found by solver - see OsiBabSolver |
![]() ![]() | Define a single integer class |
![]() ![]() | Define a single integer class but with dynamic pseudo costs |
![]() ![]() | Define a single integer class but with pseudo costs |
![]() ![]() | This allows the use of the standalone solver in a flexible manner |
![]() ![]() | The CbcSolver class was taken out at a 9/12/09 meeting This is a feeble replacement |
![]() ![]() | Branching object for Special Ordered Sets of type 1 and 2 |
![]() ![]() | Branching object for Special ordered sets |
![]() ![]() | For gathering statistics |
![]() ![]() | Support the use of a call back class to decide whether to stop |
![]() ![]() | Strategy base class |
![]() ![]() | Default class |
![]() ![]() | Default class for sub trees |
![]() ![]() | Null class |
![]() ![]() | Abstract base class for `objects' |
![]() ![]() | A class to encapsulate thread stuff |
![]() ![]() | Using MS heap implementation |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | A class to allow the use of unknown user functionality |
![]() ![]() | Stored Temporary Cut Generator Class - destroyed after first use |
![]() ![]() | Ampl Objective Class |
![]() ![]() | Ampl Constraint Class |
![]() ![]() | Really for Conflict cuts to - a) stop duplicates b) allow half baked cuts The whichRow_ field in OsiRowCut2 is used for a type 0 - normal 1 - processed cut 2 - unprocessed cut i.e |
![]() ![]() | Define BiLinear objects |
![]() ![]() | Branching object for BiLinear objects |
![]() ![]() | Define Continuous BiLinear objects for an == bound |
![]() ![]() | Cbc Solver Interface |
![]() ![]() | This class chooses a variable to branch on |
![]() ![]() | Define Special Linked Ordered Sets |
![]() ![]() | Branching object for Linked ordered sets |
![]() ![]() | List of bounds which depend on other bounds |
![]() ![]() | |
![]() ![]() | Branching object for Linked ordered sets |
![]() ![]() | Define data for one link |
![]() ![]() | Define a single integer class - but one where you keep branching until fixed even if satisfied |
![]() ![]() | This is to allow the user to replace initialSolve and resolve |
![]() ![]() | This is to allow the user to replace initialSolve and resolve This version changes coefficients |
![]() ![]() | Define a single variable class which is involved with OsiBiLinear objects |
![]() ![]() |