Cgl
trunk
|
auxiliary_graph | |
Cgl012Cut | 012Cut Generator Class |
cgl_arc | |
cgl_graph | |
cgl_node | |
CglAllDifferent | AllDifferent Cut Generator Class This has a number of sets |
CglBK | For Bron-Kerbosch |
CglClique | |
CglCutGenerator | Cut Generator Base Class |
CglDuplicateRow | DuplicateRow Cut Generator Class |
CglFakeClique | |
CglFlowCover | Lifed Simple Generalized Flow Cover Cut Generator Class |
CglFlowVUB | Variable upper bound class |
CglGomory | Gomory Cut Generator Class |
CglHashLink | Only store unique row cuts |
CglImplication | This just uses implication info |
CglKnapsackCover | Knapsack Cover Cut Generator Class |
CglLandP | |
LAP::CglLandPSimplex | |
CglLiftAndProject | Lift And Project Cut Generator Class |
CglMessage | This deals with Cgl messages (as against Osi messages etc) |
CglMixedIntegerRounding | Mixed Integer Rounding Cut Generator Class |
CglMixedIntegerRounding2 | Mixed Integer Rounding Cut Generator Class |
CglMixIntRoundVUB | |
CglMixIntRoundVUB2 | |
CglOddHole | Odd Hole Cut Generator Class |
CglParam | Class collecting parameters for all cut generators |
CglPreProcess | Class for preProcessing and postProcessing |
CglProbing | Probing Cut Generator Class |
CglRedSplit | Gomory Reduce-and-Split Cut Generator Class; See method generateCuts() |
CglRedSplitParam | Class collecting parameters the Reduced-and-split cut generator |
CglResidualCapacity | Residual Capacity Inequalities Cut Generator Class |
CglSimpleRounding | Simple Rounding Cut Generator Class |
CglStored | Stored Cut Generator Class |
CglTreeInfo | Information about where the cut generator is invoked from |
CglTreeProbingInfo | |
CglTwomir | Twostep MIR Cut Generator Class |
CglUniqueRowCuts | |
CglZeroHalf | Zero Half Cut Generator Class |
cliqueEntry | Derived class to pick up probing info |
cut | |
cut_list | |
cutParams | |
LAP::Cuts | To store extra cuts generated by columns from which they origin |
cycle | |
cycle_list | |
DGG_constraint_t | |
DGG_data_t | |
DGG_list_t | |
disaggregationAction | Only useful type of disaggregation is most normal For now just done for 0-1 variables Can be used for building cliques |
edge | |
ilp | |
info_weak | |
LAP::LandPMessages | Message handler for lift-and-project simplex |
LAP::LapMessages | Output messages for Cgl |
log_var | |
CglLandP::NoBasisError | |
CglLandP::Parameters | Class storing parameters |
parity_ilp | |
pool_cut | |
pool_cut_list | |
select_cut | |
separation_graph | |
short_path_node | |
CglLandP::SimplexInterfaceError | |
LAP::TabRow | |
LAP::Validator | Class to validate or reject a cut |