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

- File List

All Classes Functions
SolverPLIGlpk.h
1 /*****************************************************************************
2 * This code is part of Art Gallery Solver (AGSol) Package, which aims the
3 * resolution of the Art Gallery Problem With Point Guards.
4 *
5 * This software version (1.0.2) has been tested under and is compatible with
6 * CGAL 3.9 and GLPK 4.52.
7 *
8 * Authors:
9 * Davi Colli Tozoni - davi.tozoni@gmail.com
10 * Marcelo Castilho Couto - coutomarcelo@gmail.com
11 *
12 * ArtGalleryHope Concept and Design:
13 * Davi Colli Tozoni, Marcelo Castilho Couto, Pedro Jussieu de Rezende & Cid
14 * Carvalho de Souza.
15 *
16 * Other information can be found at:
17 * http://www.ic.unicamp.br/~cid/Problem-instances/Art-Gallery/index.html
18 *
19 * --
20 *
21 * This program is free software: you can redistribute it and/or modify it
22 * under the terms of the GNU General Public License as published by the Free
23 * Software Foundation, either version 3 of the License, or (at your option)
24 * any later version.
25 *
26 * This program is distributed in the hope that it will be useful, but
27 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
28 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
29 * for more details.
30 *
31 * You should have received a copy of the GNU General Public License along
32 * with this program. If not, see <http://www.gnu.org/licenses/>.
33 *
34 ****************************************************************************/
35
36
37 #ifndef SOLVER_PLI_GLPK_H
38 #define SOLVER_PLI_GLPK_H
39
40 #include <iostream>
41 #include <string>
42 #include <cstdlib>
43 #include <vector>
44 #include <glpk.h>
45
46 using namespace std;
47
48 class SolverPLIGlpk {
49 private:
50 vector<double> _bestSolution;
51 bool _isOptimal;
52
53 public:
57 int solveSCP (vector< vector<bool> > matrix, vector<int> initSol, double extLB);
58
62 vector<double> getBestSolution() { return _bestSolution; };
63
67 bool isOptimal() { return _isOptimal; }
68 };
69
70 #endif
71 #define SOLVER_PLI_GLPK_H
SolverPLIGlpk::isOptimal
bool isOptimal()
Definition: SolverPLIGlpk.h:67
SolverPLIGlpk
Definition: SolverPLIGlpk.h:48
SolverPLIGlpk::getBestSolution
vector< double > getBestSolution()
Definition: SolverPLIGlpk.h:62