Research Reports from the Department of Operations
Document Type
Report
Publication Date
8-1-1972
Abstract
Two algorithms for matroids are presented, and relations between matroids and blocking systems are explored. A method is presented for removing an element of one of the dual pairs of clutters which comprise a blocking system. The problem of how to "chop off" a vertex from a convex polyhedron without creating new vertices is dealt with. Bounds on the number of cutting planes are determined.
Keywords
Operations research, Matroids, Blocking sets, Convex sets, Algorithms, Mathematical optimization, Polyhedra--Models, Combinatorial optimization
Publication Title
Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University
Issue
Technical memorandum no. 267
Rights
This work is in the public domain and may be freely downloaded for personal or academic use
Recommended Citation
Hull, Bradley, "Results on Matroids, Blocking Systems and Convex Sets" (1972). Research Reports from the Department of Operations. 485.
https://commons.case.edu/wsom-ops-reports/485