MCPcopy Create free account

hub / github.com/coin-or/Clp / functions

Functions3,454 in github.com/coin-or/Clp

↓ 1 callersFunctiongetIterationCount
Get how many iterations it took to solve the problem (whatever "iteration" mean to the solver. */
src/OsiClp/OsiClpSolverInterface.hpp:547
↓ 1 callersFunctiongetObjValue
src/ClpModel.hpp:866
↓ 1 callersMethodgetPresolveType
src/ClpSolve.cpp:4232
↓ 1 callersMethodgetTableauColumnPart2
src/AbcSimplexDual.cpp:5468
↓ 1 callersMethodgetVectorLengths
The lengths of the major-dimension vectors. */
src/ClpNetworkMatrix.cpp:710
↓ 1 callersMethodgetVectorStarts
src/ClpNetworkMatrix.cpp:702
↓ 1 callersMethodgubVersion
Returns gub version of model or NULL
src/ClpSimplexOther.cpp:6342
↓ 1 callersMethodgutsOfDestructor
Work of destructor
src/OsiClp/OsiClpSolverInterface.cpp:8944
↓ 1 callersFunctionhashit
src/ClpPlusMinusOneMatrix.cpp:2224
↓ 1 callersMethodhiddenRows
src/ClpGubMatrix.cpp:396
↓ 1 callersMethodincrementDescendants
src/OsiClp/OsiClpSolverInterface.cpp:8578
↓ 1 callersMethodinitialBarrierNoCrossSolve
barrier solve, not to be followed by crossover
src/ClpSolve.cpp:4094
↓ 1 callersMethodinitialBarrierSolve
General barrier solve
src/ClpSolve.cpp:4121
↓ 1 callersMethodinitialProblem
Populates initial matrix from dynamic status
src/ClpDynamicMatrix.cpp:2129
↓ 1 callersFunctioninnerProductIndexed
src/ClpSimplexNonlinear.cpp:1199
↓ 1 callersFunctioninstrument_initialize
src/ClpSolve.cpp:405
↓ 1 callersFunctioninstrument_print
src/ClpSolve.cpp:483
↓ 1 callersMethodintoSimplex
src/OsiClp/OsiClpSolverInterface.cpp:10993
↓ 1 callersMethodinverseColumnScale2
src/AbcSimplex.hpp:507
↓ 1 callersMethodinverseRowScale2
src/AbcSimplex.hpp:503
↓ 1 callersFunctionisGapFree
I am not familiar enough with CoinPackedMatrix to be confident that I will implement a row-ordered version of toColumnOrderedGapFree properly.
src/ClpPresolve.cpp:1742
↓ 1 callersFunctionisIterationLimitReached
Iteration limit reached?
src/ClpModel.hpp:499
↓ 1 callersMethodlengthMatchName
Returns length of name for printing
src/Attic/ClpParam.cpp:531
↓ 1 callersMethodmakeNonFreeVariablesDualFeasible
Make non free variables dual feasible by moving to a bound
src/AbcSimplexDual.cpp:2441
↓ 1 callersMethodmarkHotStart
############################################################################ Hotstart related methods (primarily used in strong branching) ###########
src/OsiClp/OsiClpSolverInterface.cpp:1978
↓ 1 callersMethodmarkNonzero
Given a zeroed array sets possible nonzero coefficients to 1. Returns number of nonzeros */
src/ClpConstraintLinear.cpp:185
↓ 1 callersMethodmaximumNodes
Return maximum number of nodes
src/ClpNode.cpp:864
↓ 1 callersMethodmaximumSpace
Return maximum space for nodes
src/ClpNode.cpp:884
↓ 1 callersMethodmodel
examples/driver2.cpp:165
↓ 1 callersMethodmoveInfo
Move status and solution across
src/ClpSimplex.cpp:11475
↓ 1 callersFunctionmultiplyIndexed
src/CoinAbcBaseFactorization4.cpp:333
↓ 1 callersFunctionmultiplyIndexed
move stuff like this into CoinAbcHelperFunctions.hpp
src/CoinAbcBaseFactorization3.cpp:155
↓ 1 callersMethodnewLanguage
Set language
src/ClpModel.cpp:2878
↓ 1 callersFunctionnumberColumns
src/ClpModel.hpp:346
↓ 1 callersFunctionnumberDense
Returns number of dense rows
src/ClpFactorization.hpp:259
↓ 1 callersFunctionnumberDualInfeasibilities
Number of dual infeasibilities
src/ClpSimplex.hpp:749
↓ 1 callersFunctionnumberElementsL
Returns number in L area
src/ClpFactorization.hpp:276
↓ 1 callersFunctionnumberElementsR
Returns number in R area
src/ClpFactorization.hpp:284
↓ 1 callersFunctionnumberElementsU
Returns number in U area
src/ClpFactorization.hpp:268
↓ 1 callersMethodnumberSlacks
Returns number of slacks
src/CoinAbcDenseFactorization.hpp:71
↓ 1 callersMethodoptionIntField
Decodes options
src/CbcOrClpParam.cpp:1517
↓ 1 callersMethodorder
Orders rows and saves pointer to matrix.and model */
src/ClpCholeskyUfl.cpp:91
↓ 1 callersMethodoriginalBound
Restores bound to original bound
src/AbcSimplexDual.cpp:3898
↓ 1 callersFunctionoriginalLower
Return original lower bound
src/ClpSimplex.hpp:1367
↓ 1 callersFunctionoriginalStatus
src/ClpNonLinearCost.hpp:40
↓ 1 callersFunctionoriginalUpper
Return original lower bound
src/ClpSimplex.hpp:1375
↓ 1 callersFunctionparallelDual5
src/AbcSimplexParallel.cpp:1832
↓ 1 callersMethodparameterOption
Returns parameter option which matches (-1 if none)
src/Attic/ClpParam.cpp:561
↓ 1 callersFunctionpartTransposeTimes3
src/ClpPackedMatrix.cpp:9481
↓ 1 callersMethodpdco
src/ClpPdco.cpp:30
↓ 1 callersFunctionpermanentArrays
If we are using maximumRows_ and Columns_
src/ClpModel.hpp:1240
↓ 1 callersFunctionpermute
Returns address of permute region
src/ClpFactorization.hpp:157
↓ 1 callersFunctionperturbation
Amount of print out: 0 - none 1 - just final 2 - just factorizations 3 - as 2 plus a bit more 4 - verbose
src/ClpSimplex.hpp:713
↓ 1 callersMethodpivot
Pivot in a variable and out a variable. Returns 0 if okay, 1 if inaccuracy forced re-factorization, -1 if would be singular. Also updates prima
src/ClpSimplex.cpp:9158
↓ 1 callersFunctionpivotColumnBit
src/ClpPrimalColumnSteepest.cpp:183
↓ 1 callersMethodpivotColumnDantzig
Get sequenceIn when Dantzig
src/AbcMatrix.cpp:2450
↓ 1 callersFunctionpivotLOrder
src/CoinAbcBaseFactorization.hpp:129
↓ 1 callersFunctionpivotLinkedBackwards
Forward and backward linked lists (numberRows_+2) **/
src/CoinAbcBaseFactorization.hpp:121
↓ 1 callersFunctionpivotLinkedForwards
src/CoinAbcBaseFactorization.hpp:125
↓ 1 callersMethodpivotResult
Reasons to come out (normal mode/user mode): -1 normal -2 factorize now - good iteration/ NA -3 slight inaccuracy - refactorize - iteration done
src/AbcSimplexPrimal.cpp:3295
↓ 1 callersMethodpivotResultPart1
Pivot out a variable and choose an incoing one. Assumes dual feasible - will not go through a reduced cost. Returns step length in theta Ret
src/ClpSimplexDual.cpp:7666
↓ 1 callersMethodpivotRow
Returns pivot row, -1 if none
src/AbcDualRowDantzig.cpp:166
↓ 1 callersFunctionpivotSome
src/CoinAbcBaseFactorization1.cpp:970
↓ 1 callersFunctionpivotSomeAfter
src/CoinAbcBaseFactorization1.cpp:852
↓ 1 callersFunctionpivotStartup
src/CoinAbcBaseFactorization1.cpp:771
↓ 1 callersFunctionpivotWhile
src/CoinAbcBaseFactorization1.cpp:807
↓ 1 callersMethodpresolveStatus
Return presolve status (0,1,2)
src/ClpPresolve.cpp:163
↓ 1 callersMethodpresolvedModelToFile
This version of presolve updates model and saves original data to file. Returns non-zero if infeasible */
src/ClpPresolve.cpp:126
↓ 1 callersMethodprimalColumnDouble
does steepest edge double or triple update If scaleFactor!=0 then use with tableau row to update djs otherwise use updateForDjs */
src/AbcMatrix.cpp:2675
↓ 1 callersMethodprint
test/OsiClpSolverInterfaceTest.cpp:31
↓ 1 callersMethodprint
examples/driver2.cpp:137
↓ 1 callersMethodprintFinalStatus
src/ClpOutput.cpp:134
↓ 1 callersMethodprintLongHelp
Print Long help
src/CbcOrClpParam.cpp:497
↓ 1 callersMethodprintOptions
Prints parameter options
src/Attic/ClpParam.cpp:630
↓ 1 callersMethodprintPresolveStats
Print presolve stats
src/ClpOutput.cpp:897
↓ 1 callersFunctionproblemStatus
src/ClpModel.hpp:441
↓ 1 callersMethodratio
src/ClpOutput.cpp:725
↓ 1 callersFunctionrawObjectiveValue
Objective value - always minimize
src/ClpModel.hpp:1235
↓ 1 callersMethodreadMps
Read an mps file from the given filename - returns number of errors (see CoinMpsIO class) */
src/OsiClp/OsiClpSolverInterface.cpp:6004
↓ 1 callersMethodrebalance
src/AbcMatrix.cpp:1813
↓ 1 callersMethodrecomputeInfeasibilities
Recompute infeasibilities
src/AbcDualRowPivot.cpp:55
↓ 1 callersMethodreference
@name Private functions to deal with devex reference would be faster using AbcSimplex's status_, but I prefer to keep modularity. */
src/AbcPrimalColumnSteepest.hpp:140
↓ 1 callersFunctionrefresh
Purely for column generation and similar ideas. Allows matrix and any bounds or costs to be updated (sensibly). Returns non-zero if
src/ClpMatrixBase.hpp:179
↓ 1 callersMethodrefreshCosts
After modifying first copy refreshes second copy and marks as updated
src/AbcSimplex.cpp:4543
↓ 1 callersMethodreplaceColumn1
Does btranU part of replaceColumn (skipping entries)
src/ClpFactorization.cpp:3217
↓ 1 callersMethodreplaceColumn2
Does replaceColumn - having already done btranU
src/ClpFactorization.cpp:3224
↓ 1 callersFunctionreplaceColumns
0 success, -1 can't +1 accuracy problems
src/AbcSimplexFactorization.hpp:157
↓ 1 callersMethodresetStatistics
Reset all sparsity etc statistics
src/CoinAbcBaseFactorization4.cpp:4504
↓ 1 callersMethodrestoreData
Restore data
src/ClpSimplex.cpp:9736
↓ 1 callersFunctionrestoreSolution
Restore a solution from file. mode 0 normal, 1 swap rows and columns and primal and dual if 2 set then also change signs */
src/ClpParamUtils.cpp:366
↓ 1 callersFunctionrestoreSolution
Restore a solution from file. mode 0 normal, 1 swap rows and columns and primal and dual if 2 set then also change signs */
src/CbcOrClpParam.cpp:4422
↓ 1 callersFunctionrestoreSolution
Restore a solution from file. mode 0 normal, 1 swap rows and columns and primal and dual if 2 set then also change signs */
src/Attic/ClpParam.cpp:2004
↓ 1 callersMethodreturnModel
Return model - updates any scalars */
src/ClpSimplex.cpp:9963
↓ 1 callersMethodrowScale2
corresponds to rowScale etc
src/AbcSimplex.hpp:499
↓ 1 callersMethodsaveData
Save data
src/ClpSimplex.cpp:9716
↓ 1 callersFunctionsaveSolution
Dump a solution to file
src/Attic/ClpParam.cpp:2096
↓ 1 callersMethodscaleRowCopy
Scales rowCopy if column copy scaled Only called if scales already exist */
src/ClpPackedMatrix.cpp:5552
↓ 1 callersFunctionscaleRowIntegral
computeGcd */
examples/cleanModel.cpp:41
↓ 1 callersMethodscaledColumnCopy
Realy really scales column copy Only called if scales already exist. Up to user ro delete */
src/ClpPackedMatrix.cpp:5592
↓ 1 callersFunctionscalingFlag
Gets scalingFlag
src/ClpModel.hpp:729
← previousnext →1,001–1,100 of 3,454, ranked by callers