Matching 2-lattice polyhedra: Finding a maximum vector

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

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)29-61
Number of pages33
JournalDiscrete Mathematics
Volume237
Issue number1-3
DOIs
Publication statusPublished - 2001 Jun 28

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Matching 2-lattice polyhedra: Finding a maximum vector'. Together they form a unique fingerprint.

  • Cite this