TY - JOUR
T1 - Matching 2-lattice polyhedra
T2 - Finding a maximum vector
AU - Chang, Shiow Yun
AU - Llewellyn, Donna C.
AU - Vande Vate, John H.
PY - 2001/6/28
Y1 - 2001/6/28
N2 - Matching 2-lattice polyhedra are a special class of lattice polyhedra that include network flow polyhedra, fractional matching polyhedra, matroid intersection polyhedra, etc. In this paper we develop a polynomial-time extreme point algorithm for finding a maximum cardinality vector in a matching 2-lattice polyhedron.
AB - Matching 2-lattice polyhedra are a special class of lattice polyhedra that include network flow polyhedra, fractional matching polyhedra, matroid intersection polyhedra, etc. In this paper we develop a polynomial-time extreme point algorithm for finding a maximum cardinality vector in a matching 2-lattice polyhedron.
UR - http://www.scopus.com/inward/record.url?scp=0035963548&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0035963548&partnerID=8YFLogxK
U2 - 10.1016/S0012-365X(00)00219-3
DO - 10.1016/S0012-365X(00)00219-3
M3 - Article
AN - SCOPUS:0035963548
VL - 237
SP - 29
EP - 61
JO - Discrete Mathematics
JF - Discrete Mathematics
SN - 0012-365X
IS - 1-3
ER -