Edmonds polytopes and a hierarchy of combinatorial problems

Discrete Mathematics

Volumn 4, Issue 4, 1973, Pages 305-337

  Chvatal V ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000971541     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(73)90167-2     Document Type: Article

References (28)

1. A note on the branch-and-bound principle
2. Hypergraphs and Ramseyian theorems
3. Remarks on a problem of Moser
4. The complexity of theorem-proving procedures
5. Minimum partition of a matroid into independent subsets
6. Maximum matching and a polyhedron with 0 1-vertices
7. Paths tree and flowers
8. Matching: A well-solved class of integer linear programs
9. Theoretical improvements in algorithmic efficiency for network flow problems
10. Some remarks on the theory of graphs
11. Anti-blocking polyhedra
12. On directed paths and circuits
13. An algorithm for integer solutions to linear programs
14. Integral boundary points of convex polyhedra
15. 5/2 algorithm for maximum matchings in bipartite graphs
16. Reducibility among combinatorial problems
17. Normal hypergraphs and the perfect graph conjecture
18. A characterization of perfect graphs
19. Problem P. 170
20. Solution characteristics and algorithms for the vertex-packing problem
21. The factorization of linear graphs
22. Integer extreme points