#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1997

2001

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Shiow-yun Chang, Donna Crystal Llewellyn, John H. Vande Vate
- Discrete Mathematics
- 2001

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)

- Shiow-yun Chang, Donna Crystal Llewellyn, John H. Vande Vate
- Discrete Mathematics
- 2001

Two-lattice polyhedra are a special class of lattice polyhedra that include network ow poly-hedra, fractional matching polyhedra, matroid intersection polyhedra, the intersection of two polymatroids, etc. In this paper we show that the maximum sum of components of a vector in a 2-lattice polyhedron is equal to the minimum capacity of a cover for the… (More)

- ‹
- 1
- ›