Algorithms for solving a problem on the largest set of pairwise incomparable weighted vertices of a directed graph without circuits.

DOI10.1007/BF01130355zbMath1200.68174MaRDI QIDQ610000

Yu. V. Voĭtishin

Publication date: 1 December 2010

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Using dual network bounds in algorithms for solving generalized set packing/partitioning problems

This page was built for publication: Algorithms for solving a problem on the largest set of pairwise incomparable weighted vertices of a directed graph without circuits.