Totally balanced and totally unimodular matrices defined by center location problems

DOI10.1016/0166-218X(87)90062-XzbMath0648.05055MaRDI QIDQ1104945

Arie Tamir

Publication date: 1987

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

zbMATH Keywords

treesubsetsstrongly chordal graphsbitreesminimal subtree

Mathematics Subject Classification ID

Trees (05C05) Graph theory (05C99)

Related Items

An integral LP relaxation for a drayage problem, Balanced matrices, Structural properties and recognition of restricted and strongly unimodular matrices, Perfect, ideal and balanced matrices, Improved algorithms for the multicut and multiflow problems in rooted trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Domination, independent domination, and duality in strongly chordal graphs
• Characterizations of strongly chordal graphs
• On a class of balanced hypergraphs
• Solving covering problems and the uncapacitated plant location problem on trees
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• A Class of Balanced Matrices Arising from Location Problems
• Characterizations of totally balanced matrices
• Totally-Balanced and Greedy Matrices
• A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices