A divide-and-conquer local search heuristic for data visualization

DOI10.1016/j.cor.2005.01.020zbMath1113.90127OpenAlexW2131539926MaRDI QIDQ2499138

Edward A. Wasil, S. Raghu Raghavan, Bruce L. Golden, Roselyn M. Abbiw-Jackson

Publication date: 14 August 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.01.020

zbMATH Keywords

local searchquadratic assignment problemdiscrete optimizationmultidimensional scalingdata visualization

Mathematics Subject Classification ID

Search theory (90B40) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (6)

A survey for the quadratic assignment problem ⋮ On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps ⋮ A parallel water flow algorithm with local search for solving the quadratic assignment problem ⋮ Operations research and data mining ⋮ A comparison of problem decomposition techniques for the FAP ⋮ Synergies of operations research and data mining

Uses Software

• SPSS

Cites Work

• Modern multidimensional scaling: theory and applications
• The quadratic assignment problem. Theory and algorithms
• Visualizing group decisions in the analytic hierarchy process.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A divide-and-conquer local search heuristic for data visualization