sepa_closecuts.h
Go to the documentation of this file.
31 * primal feasible solution or an interior point of the LP relaxation. If the convex combination is
33 * calls all other separators to separate this point. The idea is that in this way possibly "deeper"
34 * cuts are generated. Note, however, that the new point is not a basic solution, i.e., separators
38 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
69 * The point is only stored if separation of relative interior points is used. The solution is copied.
Definition: struct_scip.h:68
SCIP_RETCODE SCIPsetBasePointClosecuts(SCIP *scip, SCIP_SOL *sol)
Definition: sepa_closecuts.c:494
type definitions for return codes for SCIP methods
Definition: struct_sol.h:73
type definitions for SCIP's main datastructure
type definitions for storing primal CIP solutions
SCIP_RETCODE SCIPincludeSepaClosecuts(SCIP *scip)
Definition: sepa_closecuts.c:425
common defines and data types used in all packages of SCIP
Definition: objbenders.h:43