Cardinality-restricted chains and antichains in partially ordered sets

Discrete Applied Mathematics

Volumn 65, Issue 1-3, 1996, Pages 421-439

  Shum, Henry ^a   Trotter Jr , L E ^b  

^a International Paper   (United States)

^b Cornell University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042631250     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(95)00045-S     Document Type: Article

References (12)

1. K. Cameron and J. Edmonds, Algorithms for optimal anti-chains. Research report CORR 79-22, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ont. (1979).
2. H. Crowder, E.L. Johnson and M.W. Padberg, Solving large scale zero-one linear programming problems, Oper. Res. 31 (1983) 803-834.
3. L.R. Ford and D.R. Fulkerson, Flows in Networks (Princeton University Press, Princeton, NY, 1962).
4. D.R Fulkerson, Anti-blocking polyhedra, J. Combin. Theory Ser. B 12 (1972) 50-71.
5. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).
6. M. Grötschel and O. Holland, Solving matching problems with linear programming, Math. Programming 33 (1985) 243-259.
7. P. Hansen, A. Hertz and J. Kuplinsky, Bounded vertex colorings of graphs, preprint (1990).
8. E.L. Lawler, Combinational Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976).
9. R.E. Marsten, XMP: a structured library of subroutines for experimental mathematical programming, ACM Trans. Math. Software 7 (1981) 481.
10. G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization (Wiley, New York, 1988).
11. A. Schrijver, Theory of Linear and Integer Programming (Wiley. New York, 1986).
12. H. Shum, Chains of bounded length and antichains of bounded width in partially ordered sets, Ph.D. Dissertation, Cornell Univeristy, Ithaca, NY (1989).