Totally balanced and totally unimodular matrices defined by center location problems
نویسندگان
چکیده
منابع مشابه
Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
We call a matrix A nearly totally unimodular if it can be obtained from a totally unimodular matrix à by adding to each row of à an integer multiple of some fixed row a of Ã. For an integer vector b and a nearly totally unimodular matrix A, we denote by PA,b the integer hull of the set {x ∈ R | Ax ≤ b}. We show that PA,b has the integer decomposition property and that we can find a decompositio...
متن کاملProbe Matrix Problems: Totally Balanced Matrices
Let M be a class of 0/1-matrices. A 0/1/?-matrix A where the ?s induce a submatrix is a probe matrix of M if the ?s in A can be replaced by 0s and 1s such that A becomes a member of M. We show that for M being the class of totally balanced matrices, it can be decided in polynomial time whether A is a probe totally balanced matrix. On our route toward proving this main result, we also prove that...
متن کاملLinear Discrepancy of Basic Totally Unimodular Matrices
We show that the linear discrepancy of a basic totally unimodular matrix A ∈ Rm×n is at most 1− 1 n+1 . This extends a result of Peng and Yan. AMS Subject Classification: Primary 11K38.
متن کاملLinear Discrepancy of Totally Unimodular Matrices
Let p ∈ [1,∞[ and cp = maxa∈[0,1]((1 − a)ap + a(1 − a)p)1/p. We prove that the known upper bound lindiscp(A) ≤ cp for the Lp linear discrepancy of a totally unimodular matrix A is asymptotically sharp, i.e., sup A lindiscp(A) = cp. We estimate cp = p p+1 ( 1 p+1 )1/p (1+εp) for some εp ∈ [0, 2−p+2], hence cp = 1− ln p p (1+ o(1)). We also show that an improvement for smaller matrices as in the ...
متن کاملTotally unimodular stochastic programs
We consider totally unimodular (TU) stochastic programs, that is, two-stage stochastic programs whose extensive-form constraint matrix is TU. We generalize the notion of total unimodularity to apply to sets of matrices and provide properties of such sets. We provide several sufficient conditions on stochastic programs to be TU. When solving TU stochastic problems using the L-shaped method, it i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1987
ISSN: 0166-218X
DOI: 10.1016/0166-218x(87)90062-x