Abstract
For a given graph G(V,E) and a given vector (......) the problem of finding a hyperplane which separates x form the polyhedron P of the matching matroid on G or proving that x belongs to P is solved by finding a minimum capacity cut on an auxiliary digraph.
Details
Title
A note on the separation problem for the matching matroid
Author(s)
Prodon, A.
Published in
Discrete Mathematics
Volume
52
Issue
2-3
Pages
307-311
Date
1984
Note
PRO 307-311
Other identifier(s)
View record in Web of Science
Laboratories
ROSO
Record Appears in
Scientific production and competences > SB - School of Basic Sciences > SB Archives > ROSO - Chair of Operations Research SO
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Record creation date
2006-02-13