Scippy

    SCIP

    Solving Constraint Integer Programs

    struct_iisfinder.h
    Go to the documentation of this file.
    1/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
    2/* */
    3/* This file is part of the program and library */
    4/* SCIP --- Solving Constraint Integer Programs */
    5/* */
    6/* Copyright (c) 2002-2025 Zuse Institute Berlin (ZIB) */
    7/* */
    8/* Licensed under the Apache License, Version 2.0 (the "License"); */
    9/* you may not use this file except in compliance with the License. */
    10/* You may obtain a copy of the License at */
    11/* */
    12/* http://www.apache.org/licenses/LICENSE-2.0 */
    13/* */
    14/* Unless required by applicable law or agreed to in writing, software */
    15/* distributed under the License is distributed on an "AS IS" BASIS, */
    16/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. */
    17/* See the License for the specific language governing permissions and */
    18/* limitations under the License. */
    19/* */
    20/* You should have received a copy of the Apache-2.0 license */
    21/* along with SCIP; see the file LICENSE. If not visit scipopt.org. */
    22/* */
    23/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
    24
    25/**@file struct_iisfinder.h
    26 * @ingroup INTERNALAPI
    27 * @brief data structures for irreducible infeasible subsystems (IIS)
    28 * @author Mark Turner
    29 */
    30
    31/*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
    32
    33#ifndef __SCIP_STRUCT_IISFINDER_H__
    34#define __SCIP_STRUCT_IISFINDER_H__
    35
    36
    37#include "scip/def.h"
    38#include "scip/type_iisfinder.h"
    39
    40#ifdef __cplusplus
    41extern "C" {
    42#endif
    43
    44/** IIS */
    46{
    47 char* name; /**< name of IIS finder */
    48 char* desc; /**< description of IIS finder */
    49 SCIP_DECL_IISFINDERCOPY ((*iisfindercopy)); /**< copy method of IIS finder or NULL if you don't want to copy your plugin into sub-SCIPs */
    50 SCIP_DECL_IISFINDERFREE ((*iisfinderfree)); /**< destructor of IIS finder */
    51 SCIP_DECL_IISFINDEREXEC ((*iisfinderexec)); /**< IIS finder generation method */
    52 SCIP_CLOCK* iisfindertime; /**< IIS finder execution time */
    53 SCIP_IISFINDERDATA* iisfinderdata; /**< IIS finder data */
    54 int priority; /**< priority of the IIS finder */
    55};
    56
    57/** IIS */
    59{
    60 SCIP* subscip; /**< The subscip that stores the IIS */
    61 SCIP_HASHMAP* varsmap; /**< The variable hashmap from the original SCIP to IIS subscip */
    62 SCIP_HASHMAP* conssmap; /**< The constraints hashmap from the original SCIP to IIS subscip */
    63 SCIP_RANDNUMGEN* randnumgen; /**< random number generator */
    64 SCIP_CLOCK* iistime; /**< IIS total execution time */
    65 int niismessagecalls; /**< The number of times an iis info message has been displayed */
    66 SCIP_Longint nnodes; /**< The number of nodes used over all IIS solves */
    67 SCIP_Bool infeasible; /**< Whether the subscip is currently infeasible, i.e., a valid IS */
    68 SCIP_Bool irreducible; /**< Whether the subscip is an irreducible infeasible subsystem, i.e., an IIS */
    69};
    70
    71#ifdef __cplusplus
    72}
    73#endif
    74
    75#endif
    common defines and data types used in all packages of SCIP
    #define SCIP_Longint
    Definition: def.h:141
    #define SCIP_Bool
    Definition: def.h:91
    SCIP_Longint nnodes
    SCIP_HASHMAP * conssmap
    SCIP * subscip
    SCIP_HASHMAP * varsmap
    SCIP_Bool irreducible
    int niismessagecalls
    SCIP_Bool infeasible
    SCIP_RANDNUMGEN * randnumgen
    SCIP_CLOCK * iistime
    SCIP_CLOCK * iisfindertime
    SCIP_DECL_IISFINDERFREE((*iisfinderfree))
    SCIP_DECL_IISFINDERCOPY((*iisfindercopy))
    SCIP_DECL_IISFINDEREXEC((*iisfinderexec))
    SCIP_IISFINDERDATA * iisfinderdata
    type definitions for IIS
    struct SCIP_IISfinderData SCIP_IISFINDERDATA