12 #ifndef DIGNEA_KP_ExpKnap_HEURISTIC_H
13 #define DIGNEA_KP_ExpKnap_HEURISTIC_H
15 #include <dignea/core/Heuristic.h>
18 #include <nlohmann/json.hpp>
36 string getName()
const {
return "ExpKnap KP"; };
38 string getID()
const {
return "ExpKnap"; }
40 void setProblem(shared_ptr<KP> prob);
42 void setProblem(
KP *prob);
nlohmann::json json
Definition: MinKnap.h:85
ExpKnap Heuristic for the Knapsack Problem. Tries to insert each item in the knapsack while there is ...
Definition: ExpKnap.h:28
string getID() const
Returns the identificator of the algorithm, this is used in the to_json method. Must be implemented i...
Definition: ExpKnap.h:38
string getName() const
Returns the name of the algorithm, this is used in the to_json method. Must be implemented in the sub...
Definition: ExpKnap.h:36
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