18 #ifndef HLIDAC_PES_SOLVER_INTERFACE_H
19 #define HLIDAC_PES_SOLVER_INTERFACE_H
32 #include "SolverConfig.h"
42 ILP_OPTIMAL, ILP_FEASIBLE, ILP_INFEASIBLE, ILP_UNBOUNDED, ILP_UNKNOWN
74 SolutionILP solveILP(
const ILPModel& m,
bool verbose,
double gap = 0.0,
double timeLimit = 0.0,
int numberOfThreads = 1,
int threadId = 0);
void initializeLocalEnvironments(int numberOfThreads)
It enables the solver to initialize all the data structures (e.g. expensive to construct) required fo...
Integer Linear Programming problem is stored in this data structure.
std::vector< double > solution
The best found solution.
Structure storing a solution of an Integer Linear Programming problem.
The file defines extended exceptions for the better error handling in the program.
double criterion
The criterion value of the solution.
std::string solverIdentification()
Returns an identification of the used solver, e.g. 'Gurobi 6.0.4'.
Status
Constants specifying whether a solution is optimal, feasible, infeasible, unbounded, or undefined, respectively.
General model for Integer Linear Programming problem.
double bound
The best known lower or upper bound.
Status status
Solution status, see Status enum.
The file defines allowed inaccuracies in a solution and constants for floats.
SolutionILP solveILP(const ILPModel &m, bool verbose, double gap=0.0, double timeLimit=0.0, int numberOfThreads=1, int threadId=0)
Integer Linear Programming solver is called to solve the problem and the solution is returned...