Max-flow, min-cut, travelling salesman, bipartite matching — the canon of NP-hard (and not-so-hard) combinatorial optimization is almost entirely graph-theory with an objective function.
Max-flow, min-cut, travelling salesman, bipartite matching — the canon of NP-hard (and not-so-hard) combinatorial optimization is almost entirely graph-theory with an objective function.