Subspaces with well-scaled frames

DOI10.1016/0024-3795(89)90450-3zbMath0675.90061OpenAlexW2010583328MaRDI QIDQ1122483

Jon Lee

Publication date: 1989

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(89)90450-3

zbMATH Keywords

totally unimodular matricesvector spaces on fieldswell-scaled frames

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05)

Related Items

Geometric comparison of combinatorial polytopes, On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants, On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond, The long-line graph of a combinatorial geometry. II: Geometries representable over two fields of different characteristics, The number of nowhere-zero flows on graphs and signed graphs, The incidence structure of subspaces with well-scaled frames, Total dual dyadicness and dyadic generating sets, On the maximal number of columns of a \(\varDelta \)-modular matrix, On circuit diameter bounds via circuit imbalances, Subspaces with well-scaled frames, On the Column Number and Forbidden Submatrices for \(\Delta\)-Modular Matrices, On the Combinatorial Diameters of Parallel and Series Connections, Rational and integral \(k\)-regular matrices., On Matroids Representable over 𝐺𝐹(3) and Other Fields, Box-total dual integrality, box-integrality, and equimodular matrices, On Proximity for k-Regular Mixed-Integer Linear Optimization, A characterization of the orientations of ternary matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear quadratic programming in oriented matroids
• A new polynomial-time algorithm for linear programming
• On linear systems with integral valued solutions
• A strongly polynomial minimum cost circulation algorithm
• Subspaces with well-scaled frames
• Decomposition of regular matroids
• Signed graphs
• Total unimodularity and the transportation problem: a generalization
• Kuratowski's and Wagner's theorems for matroids
• Incidence matrices and interval graphs
• Linear Inequalities and Related Systems. (AM-38)
• Sensitivity theorems in integer linear programming
• Converting Linear Programs to Network Problems
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• New Finite Pivoting Rules for the Simplex Method
• Maximum matching and a polyhedron with 0,1-vertices
• Lectures on matroids
• Modules unimodulaires
• Matroids and the greedy algorithm
• Two commodity network flows and linear programming
• Multi-Commodity Network Flows