Preprint series: 12-16 , Preprints
The paper is published: Springer, Mathematical Programming Computation Volume 5, Number 1, 2013.
- 90C27 Combinatorial optimization
- 52B40 Matroids (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.)
Abstract: This paper describes implementation and computational results of a polynomial test of total unimodularity. The test is a simplified version of a prior method. The program also decides two related unimodularity properties. The software is available free of charge in source code
form under the Boost Software License.
Keywords: unimodularity, total unimodularity, polynomial test