Pages that link to "Item:Q1895110"
From MaRDI portal
The following pages link to Finding optimal minors of valuated bimatroids (Q1895110):
Displaying 14 items.
- Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors (Q521811) (← links)
- Legendre duality in combinatorial study of matrix pencils (Q691986) (← links)
- Discrete convex analysis (Q1290668) (← links)
- \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids (Q1293131) (← links)
- Extension of M-convexity and L-convexity to polyhedral convex functions (Q1841175) (← links)
- Well-layered maps and the maximum-degree \(k \times k\)-subdeterminant of a matrix of rational functions (Q1895106) (← links)
- Well-layered maps---a class of greedily optimizable set functions (Q1904519) (← links)
- Two algorithms for valuated \(\Delta\)-matroids (Q1921193) (← links)
- Computing valuations of the Dieudonné determinants (Q2100059) (← links)
- Even factors, jump systems, and discrete convexity (Q2519019) (← links)
- Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors in mixed polynomial matrices (Q3121390) (← links)
- Convexity and Steinitz's exchange property (Q4645928) (← links)
- On circuit valuation of matroids (Q5933469) (← links)
- Presentations of transversal valuated matroids (Q6133798) (← links)
