11 #ifndef DIGNEA_KP_Combo_HEURISTIC_H
12 #define DIGNEA_KP_Combo_HEURISTIC_H
14 #include <dignea/core/Heuristic.h>
17 #include <nlohmann/json.hpp>
32 virtual ~
Combo() =
default;
36 string getName()
const {
return "Combo KP"; };
38 string getID()
const {
return "Combo"; }
40 void setProblem(shared_ptr<KP> prob);
42 void setProblem(
KP *prob);
nlohmann::json json
Definition: MinKnap.h:85
Combo Heuristic for the Knapsack Problem.
Definition: Combo.h:28
string getID() const
Returns the identificator of the algorithm, this is used in the to_json method. Must be implemented i...
Definition: Combo.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: Combo.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