dignea  1.0.0
Diverse Instance Generator with Novelty Search and Evolutionary Algorithms
MaP.h
1 
2 
3 #ifndef DIGNEA_KP_MAP_HEURISTIC_H
4 #define DIGNEA_KP_MAP_HEURISTIC_H
5 
6 #include <dignea/algorithms/kp_heuristics/Default.h>
7 
8 #include <nlohmann/json.hpp>
9 #include <vector>
10 
11 using json = nlohmann::json;
12 using namespace std;
13 
23 class MaP : public Default {
24  public:
25  MaP();
26 
27  virtual ~MaP() = default;
28 
29  void run() override;
30 
31  string getName() const { return "MaP KP"; };
32 
33  string getID() const { return "MaP"; }
34 };
35 
36 #endif // DIGNEA_KP_MAP_HEURISTIC_H
nlohmann::json json
Definition: MinKnap.h:85
Default Heuristic for the Knapsack Problem. Tries to insert each item in the knapsack while there is ...
Definition: Default.h:19
Maximum Profit Heuristic.
Definition: MaP.h:23
string getName() const
Returns the name of the algorithm, this is used in the to_json method. Must be implemented in the sub...
Definition: MaP.h:31
string getID() const
Returns the identificator of the algorithm, this is used in the to_json method. Must be implemented i...
Definition: MaP.h:33