Solving Constraint Integer Programs

sepa_aggregation.h File Reference

Detailed Description

flow cover and complemented mixed integer rounding cuts separator (Marchand's version)

Leona Gottwald
Kati Wolter
Tobias Achterberg

For an overview see:

Marchand, H., & Wolsey, L. A. (2001).
Aggregation and mixed integer rounding to solve MIPs.
Operations research, 49(3), 363-371.

Some remarks:

  • In general, continuous variables are less prefered than integer variables, since their cut coefficient is worse.
  • We seek for aggregations that project out continuous variables that are far away from their bound, since if it is at its bound then it doesn't contribute to the violation
  • These aggregations are also useful for the flowcover separation, so after building an aggregation we try to generate a MIR cut and a flowcover cut.
  • We only keep the best cut.

Definition in file sepa_aggregation.h.

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

Go to the source code of this file.


SCIP_RETCODE SCIPincludeSepaAggregation (SCIP *scip)