A polynomial algorithm for finding a prescribed number of best solutions of extremal problems on matroids
From MaRDI portal
Publication:1881934
zbMath1057.90545MaRDI QIDQ1881934
Publication date: 18 October 2004
Published in: Automation and Remote Control (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
This page was built for publication: A polynomial algorithm for finding a prescribed number of best solutions of extremal problems on matroids
