3 #ifndef DIGNEA_KP_MAP_HEURISTIC_H
4 #define DIGNEA_KP_MAP_HEURISTIC_H
6 #include <dignea/algorithms/kp_heuristics/Default.h>
8 #include <nlohmann/json.hpp>
27 virtual ~
MaP() =
default;
31 string getName()
const {
return "MaP KP"; };
33 string getID()
const {
return "MaP"; }
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