gets the value of an existing SCIP_Bool parameter * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is p

returns the name of the row */

Returns array values.

returns \c true iff |a| <= eps

checks, if val1 is not (more than epsilon) lower than val2 */

returns objective value of primal CIP solution w.r.t. original problem, or current LP/pseudo objective value * * @return objective value of primal

returns lower bound of variable directly before or after the bound change given by the bound change index * was applied */

prints a warning message, acting like the printf() command */

gets primal LP solution value of variable */

returns \c true iff |a| > eps

gets current node in the tree * * @return the current node of the search tree * * @pre This method can be called if @p scip is in one of the fol

returns upper bound of variable directly before or after the bound change given by the bound change index * was applied */

gets position of row in current LP, or -1 if it is not in LP */

gets negated variable x' = lb + ub - x of variable x; negated variable is created, if not yet existing; * in difference to \ref SCIPcreateVar, the n

stores given value as interval */

returns the activity that is currently stored for an expression * * @see SCIPevalExprActivity */

returns the display column of the given name, or NULL if not existing */

checks, if val1 is not (more than epsilon) greater than val2 */

gets global lower (dual) bound in transformed problem * * @return the global lower (dual) bound in transformed problem * * @pre This method can

gets the current solving time in seconds * * @return the current solving time in seconds. * * @pre This method can be called if SCIP is in one o

inserts new origin->image pair in hash map * * @note multiple insertion of same element is checked and results in an error */

increases usage counter of variable * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \re

creates a primal solution, initialized to zero * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is pass

gives the name of an expression handler */

gets number of feasible primal solutions stored in the solution storage in case the problem is transformed; * in case the problem stage is SCIP_STAG

gets the negation of the given variable; may return NULL, if no negation is existing yet */

append \p n uninitialized elements.

creates and captures problem variable; if variable is of integral type, fractional bounds are automatically rounded; * an integer variable with boun

gets user data of propagator */

Returns array indices.

sets a single integer parameter value */

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

gets user data of separator */

returns whether the given solution is defined on original variables */

sets rounding mode of floating point operations */

returns value treated as zero * * @return value treated as zero */

creates a SCIP_Real parameter, sets it to its default value, and adds it to the parameter set */

if an integer parameter exits with the given parameter name it is set to the new value */

creates a clock and initializes it */

returns whether the current node is a temporary probing node */

adds row to separation storage * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref *

gets the expression data of an expression */

checks, if val1 is (more than epsilon) greater than val2 */

gets depth of current node in the tree, i.e. the length of the active path minus 1, or -1 if no current node exists */

frees a clock */

compares two token if they are equal */

return the current basis representation.

returns whether the variable was created by negation of a different variable */

Total number of elements

rounds value - epsilon up to the next integer */

output row to file stream via the message handler system * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error co

! @name Setting the value */ @{ ! Default constructor. Value is set to (0,0,0). */

gets number of integer active problem variables * * @return the number of integer active problem variables * * @pre This method can be called if

Returns true if and only if the LP is scaled

print an expression as info-message */

returns the relative difference: (val1-val2)/max(|val1|,|val2|,1.0) */

Constructs an argument with the name of the argument; if null or omitted, this is a positional argument.

accessor overload required to override default assignment operator (templates are not allowed to replace default compiler-generated assignments).

gets name of event handler */

checks, if relative difference of values is in range of feastol */

stop timer, return accounted user time.

moves the iterator to the next expression according to the mode of the expression iterator * * @return the next expression, if any, and NULL otherwi

gets name of reader */

gets the measured time of a clock in seconds * * @return the measured time of a clock in seconds. */

gets name of separator */

changes the value of an existing SCIP_Longint parameter * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error cod

---------------------------------------- @name Access / modification */ @{ returns exception message

gets the number of times, the heuristic was called and tried to find a solution */

returns \c true iff |relDiff(a,b)| <= eps

completely stop the clock and reset the clock's counter to zero */

inserts element in hash table * * @note multiple inserts of same element overrides previous one */

gets current node of the tree, i.e. the last node in the active path, or NULL if no current node exists */

adds given values to lock numbers of type @p locktype of variable for rounding * * @return \ref SCIP_OKAY is returned if everything worked. Otherwi

gets total number of iterations used so far in primal and dual simplex and barrier algorithm * * @return the total number of iterations used so far

outputs constraint information to file stream via the message handler system * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise

compares the index of two variables, returns -1 if first is smaller than, and +1 if first is greater than second * variable index; returns 0 if both

returns TRUE iff the id is a valid column or row identifier.

return the current value of field 1 */

gets the number of subproblems for the Benders' decomposition */

returns the number of successor nodes of the given node */

gets left hand side of linear constraint */

returns value treated as zero for sums of floating point values * * @return value treated as zero for sums of floating point values */

gets array with constraints of constraint handler; the first SCIPconshdlrGetNActiveConss() entries are the active * constraints, the last SCIPconshd

initializes an expression iterator * * @note If `expr` is NULL, then iterator will be set into ended-state (SCIPexpriterIsEnd() is TRUE). Useful if

returns whether the iterator visited all expressions already */

gets name of propagator */

current data pointer is no longer valid after any of the following: extend, erase, operator=, and ~pod_vector. Take extreem care when using this funct

Sets number of nonzeros (thereby unSetup SSVectorBase).

start timer, resume accounting user, system and real time.