Functions — github.com/coin-or/Clp

CodeHub MCPcopy Create free account

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

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

⨍ Functions 3,454◇ Types & classes 257

↓ 3 callersFunctionsetColBounds

Set a single column lower and upper bound */

src/ClpModel.hpp:620

↓ 3 callersMethodsetColLower

Set the lower bounds for all columns array [getNumCols()] is an array of values for the objective. This defaults to a series of set operations

src/OsiClp/OsiClpSolverInterface.cpp:4292

↓ 3 callersMethodsetColUpper

Set a single column upper bound<br> Use DBL_MAX for infinity. */

src/AbcSimplex.hpp:1102

↓ 3 callersMethodsetColUpper

Set the upper bounds for all columns array [getNumCols()] is an array of values for the objective. This defaults to a series of set operations

src/OsiClp/OsiClpSolverInterface.cpp:4304

↓ 3 callersMethodsetColumnBounds

Set a single column lower and upper bound */

src/ClpModel.cpp:623

↓ 3 callersMethodsetCurrentOption

Sets current parameter option using string

src/CbcOrClpParam.cpp:1114

↓ 3 callersFunctionsetCurrentStatus

src/AbcNonLinearCost.hpp:55

↓ 3 callersMethodsetDoubleParameter

src/CbcOrClpParam.cpp:534

↓ 3 callersMethodsetDualObjectiveLimit

Dual objective limit

src/ClpModel.cpp:4404

↓ 3 callersFunctionsetFixedOrFree

To say a variable is fixed OR free

src/ClpInterior.hpp:368

↓ 3 callersFunctionsetInitialStatus

src/AbcNonLinearCost.hpp:60

↓ 3 callersMethodsetIntParam

src/ClpModel.cpp:1036

↓ 3 callersMethodsetObjCoeff

Set an objective function coefficient */

src/AbcSimplex.hpp:1065

↓ 3 callersMethodsetRowBounds

Set a single row lower and upper bound */

src/ClpModel.cpp:551

↓ 3 callersMethodsetRowObjective

This just loads up a row objective

src/ClpModel.cpp:314

↓ 3 callersMethodsetSparseFactorization

src/ClpSimplex.cpp:5038

↓ 3 callersMethodsetStateOfProblem

State of problem

src/AbcSimplex.hpp:476

↓ 3 callersMethodsolve

src/ClpPredictorCorrector.cpp:75

↓ 3 callersMethodspecialColumnCopy

src/ClpPackedMatrix.cpp:5753

↓ 3 callersMethodstarts

Returns array to put basis starts in

src/CoinAbcDenseFactorization.cpp:786

↓ 3 callersFunctionstatusArray

src/ClpNode.hpp:104

↓ 3 callersMethodsubsetTransposeTimes

Return <code>x *A</code> in <code>z</code> but just for indices Already in z. Note - z always packed mode */

src/AbcMatrix.cpp:3384

↓ 3 callersMethodsynchronize

This is local to Gub to allow synchronization when status is good

src/ClpGubMatrix.cpp:2554

↓ 3 callersFunctiontransposeTimes3Bit2

src/ClpPackedMatrix.cpp:8961

↓ 3 callersFunctiontransposeTimes3Bit2Odd

src/ClpPackedMatrix.cpp:8830

↓ 3 callersMethodupdateColumnFTPart1

src/CoinAbcBaseFactorization3.cpp:2289

↓ 3 callersMethodzapCosts

Get rid of real costs (just for moment)

src/ClpNonLinearCost.cpp:2023

↓ 2 callersFunctionClpCholeskyCrecRec

Non leaf recursive rectangle rectangle update, nUnder is number of rows in iBlock, nUnderK is number of rows in kBlock */

src/ClpCholeskyDense.cpp:789

↓ 2 callersFunctionClpMain0

src/ClpSolver.cpp:126

↓ 2 callersFunctionCoinAbcCompact

This compacts several sections and zeroes out end

src/CoinAbcHelperFunctions.cpp:682

↓ 2 callersFunctionCoinAbcDgemm

src/CoinAbcHelperFunctions.cpp:1658

↓ 2 callersFunctionCoinAbcDtrsm0

src/AbcSimplexParallel.cpp:2034

↓ 2 callersFunctionCoinAbcDtrsm1

src/AbcSimplexParallel.cpp:2141

↓ 2 callersFunctionCoinAbcDtrsm2

src/AbcSimplexParallel.cpp:2234

↓ 2 callersFunctionCoinAbcDtrsm3

src/AbcSimplexParallel.cpp:2331

↓ 2 callersFunctionCoinAbcDtrsmFactor

type 0 Left Lower NoTranspose Unit 1 Left Upper NoTranspose NonUnit 2 Left Lower Transpose Unit 3 Left Upper Transpose NonUnit */

src/AbcSimplexParallel.cpp:1870

↓ 2 callersFunctionCoinAbcInverseSqrts

src/CoinAbcHelperFunctions.cpp:611

↓ 2 callersFunctionCoinAbcMaximumAbsElement

src/CoinAbcHelperFunctions.cpp:299

↓ 2 callersFunctionCoinAbcMultiplyAdd

src/CoinAbcHelperFunctions.cpp:416

↓ 2 callersFunctionCoinAbcReciprocal

src/CoinAbcHelperFunctions.cpp:623

↓ 2 callersFunctionCoinAbcScaleNormalValues

src/CoinAbcHelperFunctions.cpp:363

↓ 2 callersFunctionCoinReadGetDoubleField

src/CbcOrClpParam.cpp:1592

↓ 2 callersFunctionCoinReadPrintit

src/CbcOrClpParam.cpp:471

↓ 2 callersMethodabcNonLinearCost

Return pointer to details of costs

src/AbcSimplex.hpp:284

↓ 2 callersMethodadd

Adds multiple of a column into an CoinIndexedvector You can use quickAdd to add to vector */

src/ClpNetworkMatrix.cpp:633

↓ 2 callersMethodadjustedAreaFactor

Returns areaFactor but adjusted for dense

src/CoinAbcBaseFactorization1.cpp:3362

↓ 2 callersMethodalmostDestructor

Delete all stuff

src/CoinAbcBaseFactorization1.cpp:3779

↓ 2 callersFunctionareaFactor

Whether larger areas needed

src/ClpFactorization.hpp:197

↓ 2 callersMethodbarrierPointer

src/AbcSimplex.hpp:1037

↓ 2 callersMethodblockStart

Start of each block (in stored)

src/AbcMatrix.hpp:386

↓ 2 callersMethodbounceTolerances

Does something about fake tolerances -1 initializes 1 might be optimal (back to original costs) 2 after change currentDualBound 3 might be

src/AbcSimplexDual.cpp:4997

↓ 2 callersMethodbranchAndBound

Invoke solver's built-in enumeration algorithm

src/OsiClp/OsiClpSolverInterface.cpp:9183

↓ 2 callersFunctionbreakdown

src/AbcSimplexDual.cpp:4366

↓ 2 callersFunctionbuildNQueens

─── N-Queens LP relaxation ────────────────────────────────────────────────── Place n queens on an n×n board. Variables x[i][j] ∈ [0,1]. Constraints:

test/test_racing_lp.cpp:123

↓ 2 callersFunctionbuildSetCovering

─── Set Covering LP relaxation ────────────────────────────────────────────── min sum c[j]*x[j], s.t. Ax >= 1 (each row covered), x[j] in [0,1]. Rando

test/test_racing_lp.cpp:377

↓ 2 callersFunctionbuildSetPacking

─── Set Packing LP relaxation ─────────────────────────────────────────────── max sum c[j]*x[j], s.t. Ax <= 1 (each row at most one), x[j] in [0,1].

test/test_racing_lp.cpp:408

↓ 2 callersFunctionbuildSetPartitioning

─── Set Partitioning LP relaxation ────────────────────────────────────────── min sum c[j]*x[j], s.t. Ax = 1 (each row exactly one), x[j] in [0,1].

test/test_racing_lp.cpp:439

↓ 2 callersFunctionbuildTSP20

Wrapper for TSP-MTZ (needs seed)

test/test_racing_lp.cpp:569

↓ 2 callersFunctionbuildTSP60

test/test_racing_lp.cpp:571

↓ 2 callersFunctionbuildUFL

─── UFL (Uncapacitated Facility Location) LP relaxation ───────────────────── n facilities, m clients. Binary y[i] = facility i open, x[i][j] = client

test/test_racing_lp.cpp:326

↓ 2 callersMethodcanDoPartialPricing

Says whether it can do partial pricing

src/ClpMatrixBase.cpp:181

↓ 2 callersMethodchangeState

Change state of variable i.e. go other way

src/ClpNode.cpp:664

↓ 2 callersMethodcheckArrays

For debug - prints summary of arrays which are out of kilter

src/AbcSimplex.cpp:5787

↓ 2 callersMethodcheckCompatibilityRow

Check that a basic row is indeed compatible */

src/ClpPESimplex.cpp:658

↓ 2 callersMethodcheckFeasible

Just for debug if odd type matrix. Returns number and sum of primal infeasibilities. */

src/ClpMatrixBase.cpp:400

↓ 2 callersMethodcheckMarkArrays

src/CoinAbcBaseFactorization4.cpp:4629

↓ 2 callersMethodcheckReplacePart1b

src/AbcSimplexDual.cpp:5498

↓ 2 callersMethodcheckSize

src/ClpPESimplex.cpp:716

↓ 2 callersMethodcheckSparse

See if worth going sparse

src/CoinAbcBaseFactorization4.cpp:4557

↓ 2 callersFunctionchoose

src/AbcDualRowSteepest.cpp:174

↓ 2 callersMethodcleanUp

Cleans up i.e. gets rid of network basis

src/ClpFactorization.cpp:1052

↓ 2 callersFunctionclearFixed

src/ClpInterior.hpp:344

↓ 2 callersFunctionclearFixedOrFree

src/ClpInterior.hpp:372

↓ 2 callersMethodclearFlagged

src/AbcSimplex.hpp:972

↓ 2 callersMethodclearIterationNumbers

clears iteration numbers (to switch off panic)

src/ClpSolve.cpp:4709

↓ 2 callersMethodclone

------------------------------------------------------------------- Clone -------------------------------------------------------------------

src/ClpCholeskyBase.cpp:287

↓ 2 callersMethodclone

------------------------------------------------------------------- Clone -------------------------------------------------------------------

src/ClpCholeskyTaucs.cpp:111

↓ 2 callersFunctionclpAlgoShortName

src/ClpOutput.cpp:49

↓ 2 callersFunctioncoDegenerateCompatiblePivots

src/ClpPESimplex.hpp:139

↓ 2 callersFunctioncoDualDegeneratesAvg

src/ClpPESimplex.hpp:130

↓ 2 callersFunctioncoPrimalDegeneratesAvg

src/ClpPESimplex.hpp:132

↓ 2 callersFunctioncolumnArray

Useful column length arrays (0,1,2,3,4,5)

src/ClpSimplex.hpp:829

↓ 2 callersMethodcolumnNamesAsChar

Create column names as char

src/ClpModel.cpp:4664

↓ 2 callersMethodcomplementarityGap

complementarityGap. Computes gap phase 0=as is , 1 = after predictor , 2 after corrector

src/ClpPredictorCorrector.cpp:2366

↓ 2 callersFunctioncomputeGcd

examples/cleanModel.cpp:14

↓ 2 callersMethodcopyFromSaved

Copies all saved versions to working versions and may do something for perturbation

src/AbcSimplex.cpp:153

↓ 2 callersMethodcopyinStatus

Copy in status vector

src/ClpModel.cpp:3957

↓ 2 callersFunctioncost

src/ClpSimplex.hpp:1357

↓ 2 callersFunctioncountCostedSlacks

returns -1 if none or start of costed slacks or -2 if there are costed slacks but it is messy */

src/Idiot.cpp:288

↓ 2 callersMethodcrash

src/AbcSimplex.cpp:1602

↓ 2 callersMethodcreatePiecewiseLinearCosts

Constructs a non linear cost from list of non-linearities (columns only) First lower of each column is taken as real lower Last lower is taken a

src/ClpSimplex.cpp:10014

↓ 2 callersMethodcrunch

Crunch down model

src/OsiClp/OsiClpSolverInterface.cpp:7898

↓ 2 callersFunctioncurrentPrimalTolerance

Current primal tolerance

src/ClpSimplex.hpp:1062

↓ 2 callersMethodcurrentWanted

Current number of negative reduced costs which we still need

src/AbcMatrix.hpp:363

↓ 2 callersMethodcycle

Returns cycle length in whileIterating

src/ClpSolve.cpp:4726

↓ 2 callersFunctiondebug1

src/ClpPrimalColumnSteepest.cpp:29

↓ 2 callersMethoddisableFactorization

Undo enableFactorization. Retrieve the special options and scaling and remove the temporary objective used to fake minimisation in clp. */

src/OsiClp/OsiClpSolverInterface.cpp:7019

↓ 2 callersFunctiondoSqrts

src/ClpPackedMatrix.cpp:4112

↓ 2 callersFunctiondoTwoxTwo

Whether we want to do twoxtwo part of presolve

src/ClpPresolve.hpp:240

↓ 2 callersFunctiondoubleValue

src/CbcOrClpParam.hpp:463

← previous next →601–700 of 3,454, ranked by callers