On box totally dual integral polyhedra
نویسنده
چکیده
Edmonds and Giles introduced the class of box totally dual integral polyhedra as a generalization of submodular flow polyhedra. In this paper a geometric characterization of these polyhedra is given. This geometric result is used to show that each TDI defining system for a box TDI polyhedron is in fact a box TDI system, that the class of box TDI polyhedra is in co-NP and is closed under taking projections and dominants, that the class of box perfect graphs is in co-NP, and a result of Edmonds and Giles which is related to the facets of box TDI polyhdera.
منابع مشابه
The complexity of recognizing linear systems with certain integrality properties
Let A be a 0 − 1 matrix with precisely two 1’s in each column and let 1 be the all-one vector. We show that the problems of deciding whether the linear system Ax ≥ 1, x ≥ 0 (1) defines an integral polyhedron, (2) is totally dual integral (TDI), and (3) is box-totally dual integral (box-TDI) are all co-NP-complete, thereby confirming the conjecture on NP-hardness of recognizing TDI systems made ...
متن کامل1 Total Dual Integrality
1 Total Dual Integrality Recall that if A is TUM and b, c are integral vectors, then max{cx : Ax ≤ b} and min{yb : y ≥ 0, yA = c} are attained by integral vectors x and y whenever the optima exist and are finite. This gives rise to a variety of min-max results, for example we derived König’s theorem on bipartite graphs. There are many examples where we have integral polyhedra defined by a syste...
متن کاملA Primal-Dual Algorithm for Weighted Abstract Cut Packing
Hoffman and Schwartz [13] developed the Lattice Polyhedron model and proved that it is totally dual integral (TDI), and so has integral optimal solutions. The model generalizes many important combinatorial optimization problems such as polymatroid intersection, cut covering polyhedra, min cost aborescences, etc., but has lacked a combinatorial algorithm. The problem can be seen as the blocking ...
متن کاملOn Blocking and Anti-Blocking Polyhedra in Infinite Dimensions
We consider the natural generalizations of blocking and antiblocking polyhedra in infinite dimensions, and study issues related to duality and integrality of extreme points for these sets. Using appropriate finite truncations we give conditions under which complementary slackness holds for primal-dual pairs of the infinite linear programming problems associated with infinite blocking and anti-b...
متن کاملOn a composition of independence systems by circuit identification
The composition of general bipartite subgraph respectively acyclic subdigraph independence systems and in particular of their associated polyhedra by the identification of a pair of 3-cycles resp. 2-dicycles together with its implications for an algorithmic treatment has been the central subject of recent papers. We generalize this kind of composition within the framework of independence system...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 34 شماره
صفحات -
تاریخ انتشار 1986