scientific article; zbMATH DE number 3543793
From MaRDI portal
Publication:4118980
zbMath0348.90088MaRDI QIDQ4118980
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Operations research and management science (90B99)
Related Items
Ordinal ranking and preference strength ⋮ The Secretary Problem—An Update ⋮ A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments ⋮ The median procedure in cluster analysis and social choice theory ⋮ Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach ⋮ A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ The Minimum Acceptable Violation Ranking of Alternatives from Voters’ Ordinal Rankings ⋮ Efficient algorithms using subiterative convergence for Kemeny ranking problem ⋮ Creating an acceptable consensus ranking for group decision making
