Camargue
|
Structure for storing simple DP inequalities. More...
#include <cut_structs.hpp>
Public Member Functions | |
dominoparity (std::vector< SimpleTooth > &_used_teeth, std::vector< int > &_degree_nodes, std::vector< std::pair< int, int >> &_nonneg_edges) | |
Public Attributes | |
std::vector< SimpleTooth > | used_teeth |
Simple tooth inequalities to be aggregated to get the simple DP ineq. More... | |
std::vector< int > | degree_nodes |
The handle of the inequality, nodes where the degree eqns are used. More... | |
std::vector< std::pair< int, int > > | nonneg_edges |
Edges for which is used. More... | |
Structure for storing simple DP inequalities.
In all cases, all numbers and indices refer to position in some tour_nodes
vector. They must be translated by deferencing, e.g., if (i, j)
is an edge in nonneg_edges
, it refers to the edge tour_nodes[i], tour_nodes[j]
.
std::vector<int> CMR::Sep::dominoparity::degree_nodes |
The handle of the inequality, nodes where the degree eqns are used.
std::vector<std::pair<int, int> > CMR::Sep::dominoparity::nonneg_edges |
Edges for which is used.
std::vector<SimpleTooth> CMR::Sep::dominoparity::used_teeth |
Simple tooth inequalities to be aggregated to get the simple DP ineq.