Scippy

    SCIP

    Solving Constraint Integer Programs

    sepa_disjunctive.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 sepa_disjunctive.h
    26 * @ingroup SEPARATORS
    27 * @brief disjunctive cut separator
    28 * @author Tobias Fischer
    29 * @author Marc Pfetsch
    30 *
    31 * We separate disjunctive cuts for two term disjunctions of the form \f$x_1 = 0 \vee x_2 = 0\f$. They can be generated
    32 * directly from the simplex tableau. For further information, we refer to@n
    33 * "A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with
    34 * equilibrium constraints"@n
    35 * Júdice, J.J., Sherali, H.D., Ribeiro, I.M., Faustino, A.M., Journal of Global Optimization 36(1), 89–114 (2006)
    36 *
    37 * Cut coefficients belonging to integer variables can be strengthened by the 'monoidal cut strengthening' procedure, see@n
    38 * "Strengthening cuts for mixed integer programs"@n
    39 * Egon Balas, Robert G. Jeroslow, European Journal of Operational Research, Volume 4, Issue 4, 1980, Pages 224-234
    40 */
    41
    42/*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
    43
    44#ifndef __SCIP_SEPA_DISJUNCTIVE_H__
    45#define __SCIP_SEPA_DISJUNCTIVE_H__
    46
    47
    48#include "scip/def.h"
    49#include "scip/type_retcode.h"
    50#include "scip/type_scip.h"
    51
    52#ifdef __cplusplus
    53extern "C" {
    54#endif
    55
    56/** creates the disjunctive cut separator and includes it in SCIP
    57 *
    58 * @ingroup SeparatorIncludes
    59 */
    60SCIP_EXPORT
    62 SCIP* scip /**< SCIP data structure */
    63 );
    64
    65#ifdef __cplusplus
    66}
    67#endif
    68
    69#endif
    common defines and data types used in all packages of SCIP
    SCIP_RETCODE SCIPincludeSepaDisjunctive(SCIP *scip)
    type definitions for return codes for SCIP methods
    enum SCIP_Retcode SCIP_RETCODE
    Definition: type_retcode.h:63
    type definitions for SCIP's main datastructure