#include <cstdlib>
#include "CoinPragma.hpp"
#include "CoinError.hpp"
#include "CoinTime.hpp"
#include "CouenneUserInterface.hpp"
#include "BonRegisteredOptions.hpp"
#include "BonCbc.hpp"
#include "BonCouenneSetup.hpp"
#include "BonCouenneInterface.hpp"
#include "CbcCutGenerator.hpp"
#include "CouenneCutGenerator.hpp"
#include "CouenneProblem.hpp"
Include dependency graph for Couenne.cpp:
Go to the source code of this file.
Namespaces | |
namespace | Ipopt |
namespace | Bonmin |
Defines | |
#define | PRINTED_PRECISION 1e-5 |
Functions | |
bool | parseCommandLine (int argc, char *argv[], Ipopt::SmartPtr< Ipopt::OptionsList > options) |
int | main (int argc, char *argv[]) |
Variables | |
static const int | infeasible = 1 |
#define PRINTED_PRECISION 1e-5 |
Definition at line 60 of file Couenne.cpp.
bool parseCommandLine | ( | int | argc, | |
char * | argv[], | |||
Ipopt::SmartPtr< Ipopt::OptionsList > | options | |||
) |
int main | ( | int | argc, | |
char * | argv[] | |||
) |
Definition at line 78 of file Couenne.cpp.
References Couenne::CouenneUserInterface::addBabPlugins(), COUENNE_INFINITY, Couenne::CouenneUserInterface::getCouenneProblem(), Couenne::CouenneUserInterface::getTMINLP(), infeasible, Couenne::CouenneSetup::InitializeCouenne(), Couenne::CouenneProblem::initOptions(), Couenne::J_PROBLEM(), Bonmin::BabSetupBase::MaxTime, Bonmin::Bab::model(), nt, Bonmin::Bab::numNodes(), parseCommandLine(), PRINTED_PRECISION, Couenne::CouenneSetup::registerAllOptions(), Couenne::CouenneSetup::setDoubleParameter(), Bonmin::BabSetupBase::setOptionsAndJournalist(), Couenne::CouenneUserInterface::setupJournals(), Bonmin::Bab::setUsingCouenne(), and Couenne::CouenneUserInterface::writeSolution().
const int infeasible = 1 [static] |
Definition at line 64 of file Couenne.cpp.
Referenced by Couenne::CouenneSOSBranchingObject::branch(), Couenne::CouenneComplBranchingObject::branch(), Couenne::CouenneBranchingObject::branch(), Couenne::CouenneProblem::checkNLP(), Bonmin::SubMipSolver::find_good_sol(), Couenne::CouenneCutGenerator::generateCuts(), Bonmin::EcpCuts::generateCuts(), Couenne::CouenneProblem::getIntegerCandidate(), main(), Bonmin::SubMipSolver::optimize(), CouenneSolver::solve(), and Couenne::CouenneIterativeRounding::solveMilp().