scientific article; zbMATH DE number 4116248

MaRDI QIDQ4730974zbMATH OpenFDO

Authors Jürgen Bartnick

Publication date 1989

zbMATH Keywords

heuristiclinear ordering problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Individual preferences (91B08)

Recommendations

• scientific article; zbMATH DE number 3991199
• Strong Condorcet criterion for the linear ordering problem
• A Cutting Plane Algorithm for the Linear Ordering Problem
• scientific article; zbMATH DE number 3902051
• A new heuristic algorithm solving the linear ordering problem

Cited in

(12)

• Lamarckian genetic algorithms applied to the aggregation of preferences
• Fairness and the set of optimal rankings for the linear ordering problem
• A survey on the linear ordering problem for weighted or unweighted tournaments
• Lagrangian relaxation and pegging test for linear ordering problems
• Algorithm of sequential analysis and sifting of variants for the linear ordering problem
• scientific article; zbMATH DE number 3991199 (Why is no real title available?)
• scientific article; zbMATH DE number 4005933 (Why is no real title available?)
• scientific article; zbMATH DE number 4076905 (Why is no real title available?)
• Strong Condorcet criterion for the linear ordering problem
• Rankability and linear ordering problem: probabilistic insight and algorithms
• A linear ordering problem with weighted rank
• 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 Q4730974)