Solving Constraint Integer Programs

sepa_closecuts.h File Reference

Detailed Description

closecuts meta separator

Marc Pfetsch

This separator generates a convex combination of the current LP solution and either the best primal feasible solution or an interior point of the LP relaxation. If the convex combination is proper, the new point is closer to the convex hull of the feasible points. The separator then calls all other separators to separate this point. The idea is that in this way possibly "deeper" cuts are generated. Note, however, that the new point is not a basic solution, i.e., separators relying basis information, e.g., Gomory cuts, will not work.

Definition in file sepa_closecuts.h.

#include "scip/def.h"
#include "scip/type_retcode.h"
#include "scip/type_scip.h"
#include "scip/type_sol.h"

Go to the source code of this file.


SCIP_RETCODE SCIPincludeSepaClosecuts (SCIP *scip)
SCIP_RETCODE SCIPsetBasePointClosecuts (SCIP *scip, SCIP_SOL *sol)