Total weak unimodularity: Testing and applications (Q798401)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Total weak unimodularity: Testing and applications |
scientific article; zbMATH DE number 3869525
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Total weak unimodularity: Testing and applications |
scientific article; zbMATH DE number 3869525 |
Statements
Total weak unimodularity: Testing and applications (English)
0 references
1984
0 references
An integer matrix is called totally weakly unimodular (TWU) if the following statement is true for all integral b: ''There exists x such that A\(x\geq b''\) implies ''there exists integral x such that A\(x\geq b''\). A polynomially bounded algorithm is presented that either produces an integral x satisfying A\(x\geq b\) or shows that A is not TWU for an integral matrix A and an integral vector b.
0 references
Hilbert property
0 references
totally weakly unimodular
0 references
polynomially bounded algorithm
0 references
integral vector
0 references
0 references
0 references
0.7751283645629883
0 references
0.7741621732711792
0 references
0.7736135721206665
0 references
0.7724062204360962
0 references