/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* This file is part of the program and library */ /* SCIP --- Solving Constraint Integer Programs */ /* */ /* Copyright (C) 2002-2020 Konrad-Zuse-Zentrum */ /* fuer Informationstechnik Berlin */ /* */ /* SCIP is distributed under the terms of the ZIB Academic License. */ /* */ /* You should have received a copy of the ZIB Academic License */ /* along with SCIP; see the file COPYING. If not visit scipopt.org. */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /**@file cons_countsols.h * @ingroup CONSHDLRS * @brief Constraint handler for counting feasible solutions * @author Stefan Heinz * @author Michael Winkler * */ /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/ #ifndef __SCIP_CONS_COUNTSOLS_H__ #define __SCIP_CONS_COUNTSOLS_H__ #include "scip/def.h" #include "scip/type_dialog.h" #include "scip/type_misc.h" #include "scip/type_retcode.h" #include "scip/type_scip.h" #include "scip/type_var.h" #ifdef __cplusplus extern "C" { #endif /** creates the handler for countsol constraints and includes it in SCIP * * @ingroup ConshdlrIncludes * */ SCIP_EXPORT SCIP_RETCODE SCIPincludeConshdlrCountsols( SCIP* scip /**< SCIP data structure */ ); /**@addtogroup CONSHDLRS * * @{ * * @name Constraint Handler for counting solutions * * @{ * * If this constraint handler is activated than it counts or collects all feasible solutions. We refer to \ref COUNTER for * more details about using SCIP for counting feasible solutions. */ /** dialog execution method for the count command */ SCIP_EXPORT SCIP_DECL_DIALOGEXEC(SCIPdialogExecCountPresolve); /** dialog execution method for the count command */ SCIP_EXPORT SCIP_DECL_DIALOGEXEC(SCIPdialogExecCount); /** execution method of dialog for writing all solutions */ SCIP_EXPORT SCIP_DECL_DIALOGEXEC(SCIPdialogExecWriteAllsolutions); /** execute counting */ SCIP_EXPORT SCIP_RETCODE SCIPcount( SCIP* scip /**< SCIP data structure */ ); /** returns number of feasible solutions found as SCIP_Longint; if the number does not fit into * a SCIP_Longint the valid flag is set to FALSE */ SCIP_EXPORT SCIP_Longint SCIPgetNCountedSols( SCIP* scip, /**< SCIP data structure */ SCIP_Bool* valid /**< pointer to store if the return value is valid */ ); /** returns number of counted solutions as string */ SCIP_EXPORT void SCIPgetNCountedSolsstr( SCIP* scip, /**< SCIP data structure */ char** buffer, /**< buffer to store the number for counted solutions */ int buffersize, /**< buffer size */ int* requiredsize /**< pointer to store the required size */ ); /** returns number of counted feasible subtrees */ SCIP_EXPORT SCIP_Longint SCIPgetNCountedFeasSubtrees( SCIP* scip /**< SCIP data structure */ ); /** Method to get the sparse solution. * * @note You get the pointer to the sparse solutions stored in the constraint handler (not a copy). * * @note The sparse solutions are stored w.r.t. the active variables. This are the variables which got not removed * during presolving. For none active variables the value has to be computed depending on their aggregation * type. See for more details about that \ref COLLECTALLFEASEBLES. */ SCIP_EXPORT void SCIPgetCountedSparseSols( SCIP* scip, /**< SCIP data structure */ SCIP_VAR*** vars, /**< pointer to variable array defining to variable order */ int* nvars, /**< number of variables */ SCIP_SPARSESOL*** sols, /**< pointer to the solutions */ int* nsols /**< pointer to number of solutions */ ); /** setting SCIP parameters for such that a valid counting process is possible */ SCIP_EXPORT SCIP_RETCODE SCIPsetParamsCountsols( SCIP* scip /**< SCIP data structure */ ); /** @} */ /** @} */ #ifdef __cplusplus } #endif #endif