27 #ifndef SRC_METHODS_F2_HPP_ 28 #define SRC_METHODS_F2_HPP_ 41 template<
class UserNodeLabel,
class UserEdgeLabel>
52 std::map<NodeMap::Assignment, GRBVar> x_;
54 std::map<std::pair<GEDGraph::EdgeID, GEDGraph::EdgeID>, GRBVar> y_;
66 char variable_type_()
const;
Contains the standardized input data along with basic functionality.
virtual void mip_populate_model_(const GEDGraph &g, const GEDGraph &h, GRBModel &model) final
Runs the local search from an initial node map.
virtual void mip_model_to_node_map_(const GEDGraph &g, const GEDGraph &h, GRBModel &model, NodeMap &node_map) final
Given a, possibly sub-optimally, solved unrelaxed model, this method constructs a node map and sets i...
The normalized input graphs used by GEDLIB. All labels are integers.
virtual bool mip_model_to_lsape_projection_problem_(const GEDGraph &g, const GEDGraph &h, GRBModel &model, DMatrix &lsape_instance) final
Given a, possibly sub-optimally, solved model, this method constructs an LSAPE instance for projectin...
Global namespace for GEDLIB.
Mixed integer linear programming formulation of the graph edit distance.
Abstract class for methods that use mixed integer linear programming for exactly or approximatively c...