Optimal Least-Squares Unidimensional Scaling: Improved Branch-and-Bound Procedures and Comparison to Dynamic Programming
Year of publication: |
2005
|
---|---|
Authors: | Brusco, Michael ; Stahl, Stephanie |
Published in: |
Psychometrika. - Springer. - Vol. 70.2005, 2, p. 253-270
|
Publisher: |
Springer |
Subject: | combinatorial data analysis | least-squares unidimensional scaling | branch-and-bound | dynamic programming |
-
Brusco, Michael, (2008)
-
An enhanced branch-and-bound algorithm for the talent scheduling problem
Qin, Hu, (2016)
-
In-port multi-ship routing and scheduling problem with draft limits
Mahmoodjanloo, Mehdi, (2021)
- More ...
-
Compact integer-programming models for extracting subsets of stimuli from confusion matrices
Brusco, Michael, (2001)
-
Brusco, Michael, (2008)
-
An interactive multiobjective programming approach to combinatorial data analysis
Brusco, Michael, (2001)
- More ...