Matching 2-lattice polyhedra: Finding a maximum vector

Shiow Yun Chang, Donna C. Llewellyn, John H. Vande Vate

研究成果: Article同行評審

4 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)29-61
頁數33
期刊Discrete Mathematics
237
發行號1-3
DOIs
出版狀態Published - 2001 六月 28

All Science Journal Classification (ASJC) codes

  • 理論電腦科學
  • 離散數學和組合

指紋

深入研究「Matching 2-lattice polyhedra: Finding a maximum vector」主題。共同形成了獨特的指紋。

引用此