heur_padm.h
Go to the documentation of this file.
33 * The penalty alternating direction method (PADM) heuristic is a construction heuristic which additionally needs a
36 * PADM splits the problem into several sub-SCIPs according to the decomposition, whereby the linking variables get
37 * copied and the difference is penalized. Then the sub-SCIPs are solved on an alternating basis until they arrive at
38 * the same values of the linking variables (ADM-loop). If they don't reconcile after a couple of iterations,
39 * the penalty parameters are increased (penalty-loop) and the sub-SCIPs are solved again on an alternating basis.
42 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
Definition: struct_scip.h:68
type definitions for return codes for SCIP methods
type definitions for SCIP's main datastructure
common defines and data types used in all packages of SCIP
Definition: objbenders.h:43