This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revisionBoth sides next revision |
| extensions [2019/01/25 16:02] – ↷ Links adapted because of a move operation oroehrig | extensions [2019/05/16 09:16] – [Integer Programming] mradons |
|---|
| ===== Integer Programming ===== | ===== Integer Programming ===== |
| |
| * Matthias Walter: With [[http://github.com/xammy/unimodularity-test/wiki/Polymake-Extension|this extension]] you can test an integer matrix for total unimodularity. If the answer is "no", it can return the row/column indices of a submatrix with |det| >= 2. It can also test for the related properties (strong) unimodularity, (strong) k-modularity and the Dantzig property. See [[http://www.math.uni-magdeburg.de/~walter/TUtest/|here]] for more information on implementation and theory. | * Matthias Walter: With [[http://github.com/xammy/unimodularity-test/wiki/Polymake-Extension|this extension]] you can test an integer matrix for total unimodularity. If the answer is "no", it can return the row/column indices of a submatrix with |det| >= 2. It can also test for the related properties (strong) unimodularity, (strong) k-modularity and the Dantzig property. See [[http://matthiaswalter.org/TUtest/|here]] for more information on implementation and theory. |
| |
| ===== Extended Formulations ===== | ===== Extended Formulations ===== |
| * Sven Herrmann and Andreas Spillner: [[http://www.uea.ac.uk/computing/comrit|CoMRiT]]. This extensions contains a new application metric introducing finite metric spaces as objects. The core feature is an algorithm to compute a realisation of a finite metric space using the tight-span, as described in Herrmann, Moulton, Spillner: Computing Realizations of Finite Metric Spaces. | * Sven Herrmann and Andreas Spillner: [[http://www.uea.ac.uk/computing/comrit|CoMRiT]]. This extensions contains a new application metric introducing finite metric spaces as objects. The core feature is an algorithm to compute a realisation of a finite metric space using the tight-span, as described in Herrmann, Moulton, Spillner: Computing Realizations of Finite Metric Spaces. |
| |
| ===== Other ===== | |
| |
| * Silke Horn: [[http://solros.de/polymake/poly_db|poly_db]]. Access to the [[polydb|polymake polytope database]]. (Now bundled with polymake) | |
| * releases and other information: [[http://solros.de/polymake/poly_db|poly_db]] | |
| * [[user_guide:howto:poly_db_tutorial|tutorial]] | |
| * latest: [[http://github.com/solros/poly_db|github]] | |
| |