---------------------------------------------------------------------- ! Remove all the elements from this vector and free its memory. */

Sets \p n 'th nonzero element to 0 (index \p n must exist).

resizes valarray and indarray to have at least num entries */

! \brief unpack extra information corresponding to a UserOp \param op [in] must be a UserOp \param op_arg [in] is the arguments for this opera

Read input from fp_in. * * If there is a LF, CR, CR/LF, or LF/CR it returns exactly on LF. Also counts the number of * characters. */

\addtogroup python_builtins @{

using the level graph (if possible) or Dijkstra graph data structure (depending on the used * method) we determine whether two nodes are adjacent *

returns last element in list.

returns whether given node v is in a cluster that belongs to the partition S */

prints current solution time to visualization output file */

Sets left-hand side value.

Reset nonzero memory to >= \p newmax. This methods resets the memory consumption to \p newmax. However, if \p newmax < size(), it is * reset to s

Sets right-hand side value.

sorts items in knapsack with nonincreasing weights */

issues an error message and marks the OPB data to have errors */

returns \c true iff relDiff(a,b) > eps

creates a string(char*) parameter, sets it to its default value, and adds it to the parameter set * * @return \ref SCIP_OKAY is returned if everyth

resolves variables to columns and adds them with the same single coefficient to the row; * this method caches the row extensions and flushes them af

free a aggregation row */

returns whether weak dual reductions are allowed during propagation and presolving * * @note A reduction is called weak dual, if it may discard fea

returns whether the bound change information belongs to a branching decision or a deduction */

returns bound change position in its depth level of given bound change information */

returns the objective function value of the subproblem for use in cut generation */

stores the objective function value of the subproblem for use in cut generation */

gets opposite bound type of given bound type */

calculates an estimate for the objective of the best feasible solution contained in the subtree after applying the given * branching; this estimate

checks solution for feasibility without adding it to the solution store * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a su

returns TRUE iff column is member of current LP */

globally removes constraint from all subproblems; removes constraint from the constraint set change data of the * node, where it was created, or fro

gets number of locks against upgrading the constraint, 0 means this constraint can be upgraded */

returns TRUE iff roundings of given locktype for variables in constraint or in constraint's negation are locked */

gets number of checked constraints of constraint handler; this is local information */

creates and captures a bound disjunction constraint * * @note the constraint gets captured, hence at one point you have to release it using the met

creates and captures an indicator constraint * * @note @a binvar is checked to be binary only later. This enables a change of the type in * proce

displays a long integer in decimal form fitting in a given width */

gets old bound for a bound change event */

processes the event with all event handlers with matching filter setting */

returns the Benders' decomposition of the given name, or NULL if not existing */

returns the array of currently available Benders' decomposition; active Benders' decomposition are in the first * slots of the array */

gets the linear constraint corresponding to the indicator constraint (may be NULL) */

gets variables of the original problem along with the numbers of different variable types; data may become invalid * after a call to SCIPchgVarType(

computes violation of rowprep in a given solution * * Can return whether the violation value is reliable from a floating-point accuracy point of vie

gets solution value for variable in current node * * @return solution value for variable in current node * * @pre This method can be called if @

gives the hashmap entry at the given index or NULL if entry is empty */

gives the number of entries in the internal arrays of a hash map */

creates a propagator and includes it in SCIP. All non-fundamental (or optional) callbacks will be set to NULL. * Optional callbacks can be set via s

indicates whether interval is entire, i.e., whether inf &le; -infinity and sup &ge; infinity */

checks, if the given new lower bound is at least min(oldub - oldlb, |oldlb|) times the bound * strengthening epsilon better than the old one */

checks, if the given new upper bound is at least min(oldub - oldlb, |oldub|) times the bound * strengthening epsilon better than the old one */

applies all cached changes to the LP solver */

returns whether the current LP is a relaxation of the problem for which it has been solved and its * solution value a valid local lower bound? */

gets the number of columns in the LP */

gets primal and dual solution vectors for feasible LPs * * Before calling this function, the caller must ensure that the LP has been solved to opti

returns TRUE iff LP is proven to be dual feasible */

checks if given value is treated as infinity in the LP solver */

returns TRUE iff the iteration limit was reached */

gives the variables lower bounds */

gives the variables upper bounds */

returns TRUE iff row is member of current NLP */

adds bound change with inference information to focus node, child of focus node, or probing node; * if possible, adjusts bound to integral value; *

sets the reoptimization type of this node */

sets user data of presolver; user has to free old data in advance! */

gets limit on objective function in external space */

check the reason for cut off a node and if necessary store the node */

changes the rank of LP row */

gets maximal absolute value of row vector coefficients */

sets destructor method of branching rule */

sets the removable flag of the given constraint * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is pas

sets destructor method of presolver */

sets solving process deinitialization method of separator */

sets values of multiple variables in primal CIP solution * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error co

solves the LP of the current dive; no separation or pricing is applied * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a sui

swaps two real values */

changes global upper bound of variable in preprocessing or in the current node, if the new bound is tighter * (w.r.t. bound strengthening epsilon) t

calculates an estimate for the objective of the best feasible solution contained in the subtree after applying the given * branching; this estimate

update constraint violation of a solution */

calculate the variable's distribution parameters (mean and variance) for the bounds specified in the arguments. * special treatment of infinite boun

returns whether the variable was deleted from the problem */

marks the variable to be not deletable from the problem */

clears the given line buffer */

determines symmetry */

Dimension of VectorBase.

Within a sorted list, get next block with same value * E.g. for [h1, h1, h1, h2, h2, h2, h2, h3,...] and end = 0 * returns start = 0, end = 3 *

gets a single integer parameter value */

gets maximal activity for constraint and given values of counters for infinite and huge contributions * and (if needed) delta to subtract from store

gets minimal activity for constraint and given values of counters for infinite and huge contributions * and (if needed) delta to subtract from store