AGSol (Art Gallery Solver)  1.0.2
This package contains a software capable of optimally solving the Art Gallery Problem (AGP), one interesting NP-hard problem from the Computational Geometry field. The algorithm implemented in this solution, which can be today considered the state-of-the-art technique on the AGP, can be found in details in the following paper: Davi C. Tozoni, Pedro J. de Rezende, Cid C. de Souza. A Practical Iterative Algorithm for the Art Gallery Problem using Integer Linear Programming
 All Classes Functions
Public Member Functions | List of all members
SolverPLIGlpk Class Reference

Public Member Functions

int solveSCP (vector< vector< bool > > matrix, vector< int > initSol, double extLB)
 
vector< double > getBestSolution ()
 
bool isOptimal ()
 

Member Function Documentation

vector<double> SolverPLIGlpk::getBestSolution ( )
inline

Returns best solution found.

bool SolverPLIGlpk::isOptimal ( )
inline

Return true if the solution found by GLPK is optimal.

int SolverPLIGlpk::solveSCP ( vector< vector< bool > >  matrix,
vector< int >  initSol,
double  extLB 
)

Solves SCP using GLPK API.


The documentation for this class was generated from the following files: