Totally balanced and totally unimodular matrices defined by center location problems

DOI10.1016/0166-218X(87)90062-XMaRDI QIDQ1104945zbMATH OpenFDO

Authors Arie Tamir

Publication date 1987

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

treestrongly chordal graphssubsetsbitreesminimal subtree

Mathematics Subject Classification ID

Trees (05C05) Graph theory (05C99)

Recommendations

• A Class of Balanced Matrices Arising from Location Problems
• Totally-Balanced and Greedy Matrices
• Characterizations of totally balanced matrices
• From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes
• On a Class of Totally Unimodular Matrices
• The centrosymmetric solutions of linear matrix equations
• Extremal matrix centralizers
• An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix
• scientific article; zbMATH DE number 221298
• A generalization of Tutte's characterization of totally unimodular matrices

Cites work

• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 9246 (Why is no real title available?)
• scientific article; zbMATH DE number 3634298 (Why is no real title available?)
• scientific article; zbMATH DE number 3185974 (Why is no real title available?)
• A Class of Balanced Matrices Arising from Location Problems
• A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• Characterizations of strongly chordal graphs
• Characterizations of totally balanced matrices
• Domination, independent domination, and duality in strongly chordal graphs
• On a class of balanced hypergraphs
• Solving covering problems and the uncapacitated plant location problem on trees
• Totally-Balanced and Greedy Matrices

Cited in

(8)

• Totally-Balanced and Greedy Matrices
• Perfect, ideal and balanced matrices
• A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
• Balanced matrices
• Improved algorithms for the multicut and multiflow problems in rooted trees
• A Class of Balanced Matrices Arising from Location Problems
• Structural properties and recognition of restricted and strongly unimodular matrices
• An integral LP relaxation for a drayage problem

This page was built for publication: Totally balanced and totally unimodular matrices defined by center location problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104945)