Two-lattice polyhedra: Duality and extreme points

Discrete Mathematics

Volumn 237, Issue 1-3, 2001, Pages 63-95

  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; Polymatroids; Submodularity

Indexed keywords

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

References (28)

1. E. Balas, W.R. Pulleyblank, The perfectly matchable subgraph polytope of a bipartite graph, Networks 13 (1983) 495-516.
2. R.E. Bixby, W.H. Cunningham, D.M. Topkis, The partial order of a polymatroid extreme point, Math. Oper. Res. 10 (3) (1985) 367-378.
3. S. Chang, D. Llewellyn, J. Vande Vate, An extreme point algorithm for finding a maximum matching 2-lattice vector, ISyE Technical Report No. J-94-05, ISyE, Georgia Institute of Technology, Atlanta, GA 30332.
4. W.-K. Chen, On the nonsingular submatrices of the incidence matrix of a graph over the real field, J. Franklin Inst. 289 (2) (1970) 155-166.
5. V. Chvátal, Edmonds polytopes and a hierarchy of combinatorial problems, Discrete Math. 4 (1973) 305-337.
6. R.P. Dilworth, A decomposition theorem for partially ordered sets, Ann. Math. 51 (1950) 161-166.
7. J. Edmonds, Minimum partition of a matroid into independent sets, J. Res. Nat. Bureau Stand. (B) 69 (1965) 67-72.
8. J. Edmonds, Paths, trees and flowers, Canad. J. Math. 17 (1965) 449-467.
9. 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.
10. L.R. Ford Jr., D.R. Fulkerson, Flows in networks, Princeton University Press, Princeton, NJ, 1962.
11. H.N. Gabow, M. Stallmann, An augmenting paths algorithm for linear matroid parity, Combinatorica 6 (2) (1986) 123-150.
12. T. Gallai, Über extreme Punkt-und Kantenmengen, Ann. Univ. Sci. Budapest, R. Eötvös Sect. Math. 2 (1959) 133-138.
13. 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.
14. H. Gröflin, T.M. Liebling, Connected and alternating vectors: polyhedra and algorithms, Math. Programming 20 (1981) 233-344.
15. A. Hoffman, On lattice polyhedra III: Blockers and anti-blockers of lattice clutters, Math. Programming Study 8 (1978) 197-207.
16. A. Hoffman, H.W. Kuhn, Systems of distinct representatives and linear programming, Amer. Math. Monthly 63 (1956) 455-460.
17. 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.
18. P. Jensen, B. Korte, Complexity of matroid property algorithms, SIAM J. Comput. 11 (1982) 184-190.
19. E. Johnson, On cut set integer polyhedra, Cahiers Centre Recherche Opérationelle 17 (1975) 235-251.
20. D. König, Graphs and matrices, Mat. Fizikai Lapok 38 (1931) 116-119.
21. B. Korte, L. Lovász, R. Schrader, Greedoids, Springer, Berlin, 1991.
22. H.W. Kuhn, The Hungarian method for the assignment problem, Naval Res. Logistics Quart. 2 (1955) 83-97.
23. 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.
24. M. Menger, Zur Allgemeinen Kurventheorie, Fund. Math. 10 (1927) 96-115.
25. 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.
26. W.R. Pulleyblank, Fractional matchings and the Edmonds-Gallai theorem, Discrete Appl. Math. 16 (1987) 51-58.
27. L.S. Shapley, M. Shubik, The assignment game I: The core, Internat. J. Game Theory 1 (1972) 111-130.
28. J.H. Vande Vate, Fractional matroid matchings, J. Combin. Theory 55B (1992) 133-145.