limp-cbc-0.3.2.0: cbits/coin/CbcSolverHeuristics.hpp
/* $Id: CbcSolverHeuristics.hpp 1902 2013-04-10 16:58:16Z stefan $ */
// Copyright (C) 2007, International Business Machines
// Corporation and others. All Rights Reserved.
// This code is licensed under the terms of the Eclipse Public License (EPL).
/*! \file CbcSolverHeuristics.hpp
\brief Routines for doing heuristics.
*/
#ifndef CbcSolverHeuristics_H
#define CbcSolverHeuristics_H
void crunchIt(ClpSimplex * model);
/*
On input
doAction - 0 just fix in original and return NULL
1 return fixed non-presolved solver
2 as one but use presolve Inside this
3 use presolve and fix ones with large cost
? do heuristics and set best solution
? do BAB and just set best solution
10+ then use lastSolution and relax a few
-2 cleanup afterwards if using 2
On output - number fixed
*/
OsiClpSolverInterface *
fixVubs(CbcModel & model, int skipZero2,
int & doAction,
CoinMessageHandler * /*generalMessageHandler*/,
const double * lastSolution, double dextra[6],
int extra[5]);
/** 1 - add heuristics to model
2 - do heuristics (and set cutoff and best solution)
3 - for miplib test so skip some
(out model later)
*/
int doHeuristics(CbcModel * model, int type, CbcOrClpParam *parameters_,
int numberParameters_,int noPrinting_,int initialPumpTune) ;
#endif //CbcSolverHeuristics_H