3 #ifndef DIGNEA_KP_MIW_HEURISTIC_H
4 #define DIGNEA_KP_MIW_HEURISTIC_H
6 #include <dignea/algorithms/kp_heuristics/Default.h>
8 #include <nlohmann/json.hpp>
24 virtual ~
MiW() =
default;
28 string getName()
const {
return "MiW KP"; };
30 string getID()
const {
return "MiW"; }
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
Performs the Minimum Weight Heuristic for the Knapsack Problem It sorts the elements based on their w...
Definition: MiW.h:20
string getName() const
Returns the name of the algorithm, this is used in the to_json method. Must be implemented in the sub...
Definition: MiW.h:28
string getID() const
Returns the identificator of the algorithm, this is used in the to_json method. Must be implemented i...
Definition: MiW.h:30