Branch cuts in strongly connected graphs and permutation potentials

zbMath0252.90055MaRDI QIDQ2557651

V. N. Burkov, Vitali Oscarovich Groppen

Publication date: 1972

Published in: Automation and Remote Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (4)

A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments ⋮ The median procedure in cluster analysis and social choice theory ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments

This page was built for publication: Branch cuts in strongly connected graphs and permutation potentials