# SCIP

Solving Constraint Integer Programs

 heur_simplerounding.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-2014 Konrad-Zuse-Zentrum */ 7 /* fuer Informationstechnik Berlin */ 8 /* */ 9 /* SCIP is distributed under the terms of the ZIB Academic License. */ 10 /* */ 11 /* You should have received a copy of the ZIB Academic License */ 12 /* along with SCIP; see the file COPYING. If not email to scip@zib.de. */ 13 /* */ 14 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ 15  16 /**@file heur_simplerounding.h 17  * @ingroup PRIMALHEURISTICS 18  * @brief Simple and fast LP rounding heuristic 19  * @author Tobias Achterberg 20  * 21  * Simple rounding is a very cheap heuristic that iterates over the set of fractional variables of an LP-feasible 22  * point. It only performs roundings for variable that have zero up- or downlocks. Hence, they are guaranteed to keep 23  * all constraints satisfied. If all fractional variables can be rounded that way, the resulting solution will bve 24  * integral and LP-feasible. 25  */ 26  27 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/ 28  29 #ifndef __SCIP_HEUR_SIMPLEROUNDING_H__ 30 #define __SCIP_HEUR_SIMPLEROUNDING_H__ 31  32  33 #include "scip/scip.h" 34  35 #ifdef __cplusplus 36 extern "C" { 37 #endif 38  39 /** creates the simple rounding heuristic and includes it in SCIP */ 40 extern 42  SCIP* scip /**< SCIP data structure */ 43  ); 44  45 #ifdef __cplusplus 46 } 47 #endif 48  49 #endif 50  Generated on Wed Apr 2 2014 for SCIP Doxygen Documentation by doxygen (1.8.2) © 2024 by Zuse Institute Berlin (ZIB), Imprint designed with Bootstrap