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

- Main Page
- Classes
- Files

- Class List
- Class Index
- Class Hierarchy
- Class Members

All Classes Functions
Lagrangian Member List

This is the complete list of members for Lagrangian, including all inherited members.

dual() | Lagrangian |
getBestUBIt() | Lagrangian |
getIterations() | Lagrangian |
getLB() | Lagrangian |
getSolution() | Lagrangian |
getUB() | Lagrangian |
heuristicNew(int paramGreedy) | Lagrangian |
Lagrangian(const vector< vector< bool > > &matrix, double extLB=0.0) | Lagrangian |
problemReduction() | Lagrangian |
relaxation() | Lagrangian |
setOptimal(int *solution, int size) | Lagrangian |
~Lagrangian() | Lagrangian |