Unimodularity Test

Implementation of a unimodularity test. 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 for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 5 articles , 1 standard article )

Showing results 1 to 5 of 5.
Sorted by year (citations)

  1. Lange, Jan-Hendrik; Pfetsch, Marc E.; Seib, Bianca M.; Tillmann, Andreas M.: Sparse recovery with integrality constraints (2020)
  2. De Loera, Jesús A.; Goaoc, Xavier; Meunier, Frédéric; Mustafa, Nabil H.: The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (2019)
  3. Tillmann, Andreas M.: Computing the spark: mixed-integer programming for the (vector) matroid girth problem (2019)
  4. Assarf, Benjamin; Gawrilow, Ewgenij; Herr, Katrin; Joswig, Michael; Lorenz, Benjamin; Paffenholz, Andreas; Rehn, Thomas: Computing convex hulls and counting integer points with \textttpolymake (2017)
  5. Walter, Matthias; Truemper, Klaus: Implementation of a unimodularity test (2013)