Branch-and-Bound Applications in Combinatorial Data Analysis formatIsbn:Softcover - 9781441920393 Veranstaltung: SE: Herausforderungen und Chancen

Veranstaltung: SE: Herausforderungen und Chancen weltweiter Migration

and methods used in field ecology

Veranstaltung: Entwicklungspolitik

• speeding up algorithms for the maximum clique problem

Veranstaltung: Das Deutsche Kaiserreich als Krisen- und Umbruchszeit

Branch-and-Bound Applications in Combinatorial Data Analysis formatIsbn:Softcover - 9781441920393 Veranstaltung: SE: Herausforderungen und ChancenThis monograph focuses on the application of the solution strategy known as branch and bound to problems of combinatorial data analysis. Combinatorial data analysis problems typically require either the sel tion of a subset of objects from a larger (master) set, the grouping of a collection of objects into mutually exclusive and exhaustive subsets, or the sequencing of objects. To obtain verifiably optimal solutions for this class of problems, we must