Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants
From MaRDI portal
Publication:4891748
DOI10.1137/0917064zbMath0871.65030OpenAlexW1965530691MaRDI QIDQ4891748
Izumi Sakuta, Satoru Iwata, Kazuo Murota
Publication date: 1 October 1997
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2433/59713
algorithmscombinatorial optimizationminordifferential algebraic equationsassignment problemrational function matrixKronecker formmaximal degreesubdeterminantSmith-McMillan form at infinity
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Index Reduction via Unimodular Transformations ⋮ A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with \(2 \times 2\) submatrices ⋮ Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation ⋮ Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation ⋮ Index reduction for differential-algebraic equations by substitution method ⋮ Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors
This page was built for publication: Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants
