scientific article; zbMATH DE number 3833066

MaRDI QIDQ3038367zbMATHFDO

Authors Ulrich Tüshaus

Publication date 1983

zbMATH Keywords

algorithmslinear programmingdynamic programmingfoundationsmethodsqualitative variablesbinary relationships

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to statistics (62-02)

Cited in

(7)

• A cutting plane algorithm for a clustering problem
• Analyse qualitativer Daten: Einführung und Übersicht. I
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
• New bounds and constraint propagation techniques for the clique partitioning problem
• A survey on the linear ordering problem for weighted or unweighted tournaments
• Facets of the clique partitioning polytope
• Median linear orders: Heuristics and a branch and bound algorithm

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3038367)