Subspaces with well-scaled frames
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 3121293 (Why is no real title available?)
- scientific article; zbMATH DE number 3121294 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3791941 (Why is no real title available?)
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3608715 (Why is no real title available?)
- scientific article; zbMATH DE number 3290885 (Why is no real title available?)
- scientific article; zbMATH DE number 3353075 (Why is no real title available?)
- scientific article; zbMATH DE number 3409134 (Why is no real title available?)
- scientific article; zbMATH DE number 3200669 (Why is no real title available?)
- A new polynomial-time algorithm for linear programming
- A strongly polynomial minimum cost circulation algorithm
- Converting Linear Programs to Network Problems
- Decomposition of regular matroids
- Incidence matrices and interval graphs
- Kuratowski's and Wagner's theorems for matroids
- Lectures on matroids
- Linear Inequalities and Related Systems. (AM-38)
- Linear quadratic programming in oriented matroids
- Matroids and the greedy algorithm
- Maximum matching and a polyhedron with 0,1-vertices
- Modules unimodulaires
- Multi-Commodity Network Flows
- New Finite Pivoting Rules for the Simplex Method
- On linear systems with integral valued solutions
- Sensitivity theorems in integer linear programming
- Signed graphs
- Subspaces with well-scaled frames
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Total unimodularity and the transportation problem: a generalization
- Two commodity network flows and linear programming
Cited in
(20)- On the maximal number of columns of a \(\Delta \)-modular integer matrix: bounds and computations
- Total dual dyadicness and dyadic generating sets
- On circuit diameter bounds via circuit imbalances
- On Proximity for k-Regular Mixed-Integer Linear Optimization
- Total dual dyadicness and dyadic generating sets
- Box-total dual integrality, box-integrality, and equimodular matrices
- The incidence structure of subspaces with well-scaled frames
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
- The number of nowhere-zero flows on graphs and signed graphs
- Subspaces with well-scaled frames
- On the Column Number and Forbidden Submatrices for \(\Delta\)-Modular Matrices
- Rational and integral \(k\)-regular matrices.
- On Matroids Representable over 𝐺𝐹(3) and Other Fields
- The long-line graph of a combinatorial geometry. II: Geometries representable over two fields of different characteristics
- On circuit diameter bounds via circuit imbalances
- A characterization of the orientations of ternary matroids
- On the number of distinct rows of a matrix with bounded subdeterminants
- On the Combinatorial Diameters of Parallel and Series Connections
- Geometric comparison of combinatorial polytopes
- On the maximal number of columns of a \(\varDelta \)-modular matrix
This page was built for publication: Subspaces with well-scaled frames
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122483)
