1 problem

0 votes0 replies0 views
McCormick's strong-polynomiality conjecture for maximum abstract flow
Let $(E,\mathcal{P})$ be an abstract network. Suppose there is a combinatorial, strongly polynomial algorithm for the abstract shortest $s$ - $t$ -path problem that accesses…
Conjectureopenabstract-networks combinatorial-optimization network-flowsarXiv posted 2 days ago

McCormick's strong-polynomiality conjecture for maximum abstract flow