- Full text PDF available (7)
- This year (0)
- Last five years (0)
We recently noticed an error in our paper, " Local optimization on graphs " , The error is not too serious, in that all of the lemmata, propositions, and theorems are correct as given. However, the divide-and-conquer algorithm in Section 2.1, p. 159, is incomplete. The necessary changes are as follows (all changes are to p. 159): (2) In Steps 1 and 2, " S "… (More)
Matching 2-lattice polyhedra are a special class of lattice polyhedra that include network ow polyhedra, fractional matching polyhedra, matroid intersection polyhedra, etc. In this paper we develop a polynomial-time extreme point algorithm for ÿnding a maximum cardinality vector in a matching 2-lattice polyhedron.
This is the first in a series of papers that explores a class of polyhedra we call 2-lattice polyhedra. 2-Lattice polyhedra are a special class of lattice polyhedra that include network flow polyhedra, fractional matching polyhedra, matroid intersection polyhedra, the intersection of two polyma-troids, etc. In this paper we show that the maximum sum of… (More)