Matching 2-lattice polyhedra: Finding a maximum vector

Discrete Mathematics

Volumn 237, Issue 1-3, 2001, Pages 29-61

  Chang, Shiow Yun ^a   Llewellyn, Donna C ^b   Vande Vate, John H ^b  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

^b Georgia Institute of Technology   (United States)

Author keywords

Lattice polyhedra; Matching; Matroids; Polymatriods; Submodularity

Indexed keywords

EID: 0035963548     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00219-3     Document Type: Article

References (16)

1. E. Balas, W. R. Pulleyblank, The perfectly matchable subgraph polytope of a bipartite graph, Networks 13 (1983) 495-516.
2. S. Chang, D. Llewellyn, J. Vande Vate, 2-Lattice polyhedra: duality and extreme points, ISyE Technical Report No. J-94-03, ISyE, Georgia Institute of Technology, Atlanta, GA 30332.
3. J. Edmonds, Submodular functions, matroids and certain polyhedra, in: R. Guy, et al. (Eds.), Combinatorial Structures and their Applications, Proceedings of the Calgary International Conference, Gordon and Breach, New York, 1970, pp. 67-87.
4. H.N. Gabow, M. Stallmann, An augmenting paths algorithm for linear matroid parity, Combinatorica 6 (2) (1986) 123-150.
5. H. Gröflin, A. Hoffman, On lattice polyhedra II: Generalization, construction and examples, in: E. Mendelsohn (Ed.), Algebraic and Geometric Combinatorics, Annals of Discrete Mathematics, vol. 15, North-Holland, Amsterdam, 1982, pp. 189-204.
6. A. Hoffman, On lattice polyhedra III: blockers and anti-blockers of lattice clutters, Math. Programming Study 8 (1978) 197-207.
7. A. Hoffman, H.W. Kuhn, Systems of distinct representatives and linear programming, Amer. Math. Monthly 63 (1956).
8. A. Hoffman, D. Schwartz, On lattice polyhedra, in: A. Hajnal, V.T. Sos (Eds.), Colloquia Mathematica Societatis János Bolyai, vol. 18, Combinatorics, Keszthely, Hungary, 1976, pp. 593-598.
9. P. Jensen, B. Korte, Complexity of matroid property algorithms, SIAM J. Comput. 11 (1982) 184-190.
10. E. Johnson, On cut set integer polyhedra, Cahiers Centre Recherche Opérationelle 17 (1975) 235-251.
11. B. Korte, L. Lovász, R. Schrader, Greedoids, Springer, Berlin, 1991.
12. H.W. Kuhn, The Hungarian method for the assignment problem, Naval Res. Logistics Quart. 2 (1955) 83-97.
13. E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Reinhart & Winston, New York, 1976.
14. L. Lovasz, The matroid matching problem, in: L. Lovasz, V.T. Sos (Eds.), Algebraic Methods in Graph Theory, Colloquia Mathematica Societatis János Bolyai, Szeged, Hungary, 1978.
15. J.B. Orlin, J.H. Vande Vate, Solving the linear matroid parity problem as a sequence of matroid intersection problems, Math. Programming 47 (1990) 81-106.
16. J.H. Vande Vate, Fractional matroid matchings, J. Combin. Theory 55 B (1992) 133-145.