27 #ifndef SRC_METHODS_BLP_NO_EDGE_LABELS_HPP_ 28 #define SRC_METHODS_BLP_NO_EDGE_LABELS_HPP_ 43 template<
class UserNodeLabel,
class UserEdgeLabel>
54 std::map<NodeMap::Assignment, GRBVar> x_;
56 std::map<NodeMap::Assignment, GRBVar> s_;
58 std::map<NodeMap::Assignment, GRBVar> t_;
70 char variable_type_()
const;
Contains the standardized input data along with basic functionality.
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...
Binary linear programming formulation of the graph edit distance without edge labels.
virtual void mip_populate_model_(const GEDGraph &g, const GEDGraph &h, GRBModel &model) final
Runs the local search from an initial node map.
The normalized input graphs used by GEDLIB. All labels are integers.
Global namespace for GEDLIB.
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...
Abstract class for methods that use mixed integer linear programming for exactly or approximatively c...