Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants (Q4891748)
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: Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants |
scientific article; zbMATH DE number 926314
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants |
scientific article; zbMATH DE number 926314 |
Statements
Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants (English)
0 references
1 October 1997
0 references
rational function matrix
0 references
minor
0 references
subdeterminant
0 references
Kronecker form
0 references
Smith-McMillan form at infinity
0 references
maximal degree
0 references
algorithms
0 references
assignment problem
0 references
combinatorial optimization
0 references
differential algebraic equations
0 references
0.9022535
0 references
0.8982336
0 references
0.8832787
0 references
0.8808554
0 references
0.88057435
0 references
0.88035506
0 references
0.8798845
0 references
0.8796333
0 references
