A polynomial time algorithm for unidimensional unfolding representations

Two conditions on a collection of simple orders - unimodality and straightness - are necessary but not jointly sufficient for unidimensional unfolding representations. From the analysis of these conditions, a polynomial time algorithm is derived for the testing of unidimensionality and for the construction of a representation when one exists. © 1994 Academic Press, Inc.SCOPUS: ar.j