Hello Is it possible to decide whether a given or calculated lower bound is the optimal solution for a problem, like a Arc Routing Problem? If yes, when is a lower bound the optimal solution? I just ...
Suppose a bipartite graph $G=(V_1 \cup V_2, E)$ is given, and one is interested in matching vertices $V_1$ to vertices $V_2$. Assume Hall's condition does not hold, so a perfect matching does not ...