Solving Constraint Integer Programs
data structure to store a single bilinear term (similar to SCIP_QUADELEM) except for temporary reasons, we assume that the index of var1 is smaller than the index of var2
Definition at line 92 of file cons_quadratic.h.
#include <cons_quadratic.h>
Definition at line 94 of file cons_quadratic.h.
Referenced by addBilinearTerm(), checkFactorable(), generateCutConvex(), generateCutNonConvex(), generateCutUnboundedLP(), mergeAndCleanBilinearTerms(), printQuadraticRow(), removeFixedVariables(), replaceQuadVarTermPos(), SCIP_DECL_CONSCOPY(), and SCIP_DECL_QUADCONSUPGD().
Definition at line 95 of file cons_quadratic.h.
Definition at line 96 of file cons_quadratic.h.
Referenced by addBilinearTerm(), checkFactorable(), generateCutConvex(), generateCutNonConvex(), generateCutUnboundedLP(), mergeAndCleanBilinearTerms(), readNonlinearExprs(), removeFixedVariables(), replaceQuadVarTermPos(), SCIP_DECL_CONSCOPY(), and SCIP_DECL_QUADCONSUPGD().