scientific article; zbMATH DE number 3902379

MaRDI QIDQ3680598zbMATH OpenFDO

Authors David Arditti

Publication date 1984

zbMATH Keywords

epsilon-optimal solutionLagrangian relaxationpaired comparisonrankingsearch algorithmsubgradient optimizationtotal order

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Individual preferences (91B08)

Recommendations

• A new reordering method for comprehensive evaluation and its solving algorithm
• On algorithms to find \(p\)-ordering
• scientific article; zbMATH DE number 1303559
• scientific article; zbMATH DE number 3958758
• New results in minimum-comparison sorting
• scientific article; zbMATH DE number 3846631
• A new heuristic algorithm solving the linear ordering problem
• An algorithm for ordinal classification based on pairwise comparison
• scientific article; zbMATH DE number 3246389
• Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnés

Cited in

(10)

• NP-hardness results for the aggregation of linear orders into median orders
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
• A survey on the linear ordering problem for weighted or unweighted tournaments
• scientific article; zbMATH DE number 3846631 (Why is no real title available?)
• scientific article; zbMATH DE number 3907591 (Why is no real title available?)
• scientific article; zbMATH DE number 3958758 (Why is no real title available?)
• Determining optimally ordered pairs using edge-coloring of graphs
• Ein Subgradientenverfahren zur Klassifikation qualitativer Daten
• Analyse qualitativer Daten: Einführung und Übersicht. I
• An updated survey on the linear ordering problem for weighted or unweighted tournaments

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 Q3680598)