Maximum matching and a polyhedron with 0,1-vertices
نویسندگان
چکیده
منابع مشابه
Maximum Matching and a Polyhedron With O,1-Vertices1
An algorithm is described for optimally pamng a finit e set of objects. That is, given a real numerical weight for each unordered pair of objects in a se t Y, to selec t a family of mutually di sjoint pairs th e sum of whose wei ghts is maximum . The well-known optimum assignment proble m [5)2 is the sp ecial case where Y partitions into two se ts A and B suc h that pairs contained in A and pai...
متن کاملEstimating the number of vertices of a polyhedron
Given a polyhedron P by a list of inequalities we develop unbiased estimates of the number of vertices and bases of P . The estimates are based on applying tree estimation methods to the reverse search technique. The time to generate an unbiased estimate is essentially bounded by the time taken to solve a linear program on P with the simplex method. Computational experience is reported. The met...
متن کاملGenerating all vertices of a polyhedron is hard 1 , 2
We show that generating all negative cycles of a weighted graph is a hard enumeration problem, in both the directed and undirected cases. More precisely, given a family of (directed) negative cycles, it is an NP-complete problem to decide whether this family can be extended or there are no other negative (directed) cycles in the graph, implying that (directed) negative cycles cannot be generate...
متن کاملa comparison of teachers and supervisors, with respect to teacher efficacy and reflection
supervisors play an undeniable role in training teachers, before starting their professional experience by preparing them, at the initial years of their teaching by checking their work within the proper framework, and later on during their teaching by assessing their progress. but surprisingly, exploring their attributes, professional demands, and qualifications has remained a neglected theme i...
15 صفحه اولAnalysis of Backtrack Algorithms for Listing All Vertices and All Faces of a Convex Polyhedron
In this paper, we investigate the applicability of backtrack technique to solve the vertex enumeration problem and the face enumeration problem for a convex polyhedron given by a system of linear inequalities. We show that there is a linear-time backtrack algorithm for the face enumeration problem whose space complexity is polynomial in the input size, but the vertex enumeration problem require...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics
سال: 1965
ISSN: 0022-4340
DOI: 10.6028/jres.069b.013