76 #ifndef DIGNEA_KP_MinKnap_HEURISTIC_H
77 #define DIGNEA_KP_MinKnap_HEURISTIC_H
79 #include <dignea/core/Heuristic.h>
82 #include <nlohmann/json.hpp>
100 string getName()
const {
return "MinKnap KP"; };
102 string getID()
const {
return "MinKnap"; }
104 void setProblem(shared_ptr<KP> prob);
106 void setProblem(
KP *prob);
nlohmann::json json
Definition: MinKnap.h:85
Front class which stores the final results of an EA execution.
Definition: Front.h:26
Base heuristic class. This is the skeleton for future heuristic implementations. Extends AbstractEA f...
Definition: Heuristic.h:19
Class representing a Knapsack Problem.
Definition: KP.h:28
MinKnap Heuristic for the Knapsack Problem. Tries to insert each item in the knapsack while there is ...
Definition: MinKnap.h:92
string getID() const
Returns the identificator of the algorithm, this is used in the to_json method. Must be implemented i...
Definition: MinKnap.h:102
string getName() const
Returns the name of the algorithm, this is used in the to_json method. Must be implemented in the sub...
Definition: MinKnap.h:100