/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* This file is part of the program and library */ /* SCIP --- Solving Constraint Integer Programs */ /* */ /* Copyright 2002-2022 Zuse Institute Berlin */ /* */ /* Licensed under the Apache License, Version 2.0 (the "License"); */ /* you may not use this file except in compliance with the License. */ /* You may obtain a copy of the License at */ /* */ /* http://www.apache.org/licenses/LICENSE-2.0 */ /* */ /* Unless required by applicable law or agreed to in writing, software */ /* distributed under the License is distributed on an "AS IS" BASIS, */ /* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. */ /* See the License for the specific language governing permissions and */ /* limitations under the License. */ /* */ /* You should have received a copy of the Apache-2.0 license */ /* along with SCIP; see the file LICENSE. If not visit scipopt.org. */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /**@file type_benderscut.h * @ingroup TYPEDEFINITIONS * @brief type definitions for Benders' decomposition cut * @author Stephen J. Maher * * This file defines the interface for Benders' decomposition cut implemented in C. * */ /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/ #ifndef __SCIP_TYPE_BENDERSCUT_H__ #define __SCIP_TYPE_BENDERSCUT_H__ #include "scip/def.h" #include "scip/type_scip.h" #include "scip/type_result.h" #include "scip/type_timing.h" #ifdef __cplusplus extern "C" { #endif typedef struct SCIP_Benderscut SCIP_BENDERSCUT; /**< Benders' decomposition cut */ typedef struct SCIP_BenderscutData SCIP_BENDERSCUTDATA; /**< locally defined Benders' decomposition cut data */ /** copy method for the Benders' decomposition cut plugins (called when SCIP copies plugins) * * input: * - scip : SCIP main data structure * - benders : the Benders' decomposition structure * - benderscut : the Benders' decomposition cut structure */ #define SCIP_DECL_BENDERSCUTCOPY(x) SCIP_RETCODE x (SCIP* scip, SCIP_BENDERS* benders, SCIP_BENDERSCUT* benderscut) /** destructor of the Benders' decomposition cut to free user data (called when SCIP is exiting) * * input: * - scip : SCIP main data structure * - benderscut : the Benders' decomposition cut structure */ #define SCIP_DECL_BENDERSCUTFREE(x) SCIP_RETCODE x (SCIP* scip, SCIP_BENDERSCUT* benderscut) /** initialization method of the Benders' decomposition cut (called after problem was transformed) * * input: * - scip : SCIP main data structure * - benderscut : the Benders' decomposition cut structure */ #define SCIP_DECL_BENDERSCUTINIT(x) SCIP_RETCODE x (SCIP* scip, SCIP_BENDERSCUT* benderscut) /** deinitialization method of the Benders' decomposition cut (called before transformed problem is freed) * * input: * - scip : SCIP main data structure * - benderscut : the Benders' decomposition cut structure */ #define SCIP_DECL_BENDERSCUTEXIT(x) SCIP_RETCODE x (SCIP* scip, SCIP_BENDERSCUT* benderscut) /** solving process initialization method of the Benders' decomposition cut (called when branch and bound process is about to begin) * * This method is called when the presolving was finished and the branch and bound process is about to begin. * * input: * - scip : SCIP main data structure * - benderscut : the Benders' decomposition cut structure */ #define SCIP_DECL_BENDERSCUTINITSOL(x) SCIP_RETCODE x (SCIP* scip, SCIP_BENDERSCUT* benderscut) /** solving process deinitialization method of the Benders' decomposition cut (called before branch and bound process data is freed) * * This method is called before the branch and bound process is freed. * The Benders' decomposition cut should use this call to clean up its branch and bound data. * * input: * - scip : SCIP main data structure * - benderscut : the Benders' decomposition cut structure */ #define SCIP_DECL_BENDERSCUTEXITSOL(x) SCIP_RETCODE x (SCIP* scip, SCIP_BENDERSCUT* benderscut) /** execution method of the Benders' decomposition cut technique * * input: * - scip : SCIP main data structure * - benders : the Benders' decomposition structure * - benderscut : the Benders' cut structure * - sol : the solution that was used for setting up the subproblems * - probnumber : the number of the subproblem from which the cut is generated * - type : the enforcement type that called the subproblem solve * - result : pointer to store the result of the cut algorithm * * possible return values for *result (if more than one applies, the first in the list should be used): * - SCIP_DIDNOTRUN : if the Benders' cut was not run. * - SCIP_DIDNOTFIND : if the Benders' cut was run, but there was an error in generating the cut. * - SCIP_FEASIBLE : if the Benders' decomposition cut algorithm has not generated a constraint or cut. * - SCIP_CONSADDED : an additional constraint for the Benders' decomposition cut was generated * - SCIP_SEPARATED : a cutting plane representing the Benders' decomposition cut was generated */ #define SCIP_DECL_BENDERSCUTEXEC(x) SCIP_RETCODE x (SCIP* scip, SCIP_BENDERS* benders, SCIP_BENDERSCUT* benderscut,\ SCIP_SOL* sol, int probnumber, SCIP_BENDERSENFOTYPE type, SCIP_RESULT* result) #ifdef __cplusplus } #endif #endif