On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps
From MaRDI portal
Publication:1681355
DOI10.1016/j.ejor.2017.07.023zbMath1374.90271OpenAlexW2735109702MaRDI QIDQ1681355
Vanesa Guerrero, Dolores Romero Morales, Emilio Carrizosa
Publication date: 23 November 2017
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10398/f890206b-242e-4dbf-ab42-89bcdfbfcd21
visualizationmixed integer linear programmingmultidimensional scalingfrequencies and adjacenciesrectangular maps
Related Items (2)
A matheuristic for large-scale capacitated clustering ⋮ On mathematical optimization for clustering categories in contingency tables
Uses Software
Cites Work
- Unnamed Item
- An improved two-stage optimization-based framework for unequal-areas facility layout
- Parallel branch and bound for multidimensional scaling with city-block distances
- On area-efficient drawings of rectangular duals for VLSI floor-plan
- On rectangular cartograms
- On rectilinear duals for vertex-weighted plane graphs
- Branch and bound algorithm for multidimensional scaling with city-block metric
- Variable neighborhood search
- Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach
- Visualizing data as objects by DC (difference of convex) optimization
- An experimental comparison of seriation methods for one-mode two-way data
- Estimating the city-block two-dimensional scaling model with simulated annealing
- A convex optimisation framework for the unequal-areas facility layout problem
- Operations research and data mining
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- A divide-and-conquer local search heuristic for data visualization
- Modern multidimensional scaling. Theory and applications.
- Operational research from Taylorism to terabytes: a research agenda for the analytics age
- Global Approaches for Facility Layout and VLSI Floorplanning
- On the Selection of the Globally Optimal Prototype Subset for Nearest-Neighbor Classification
- Improved Grid Map Layout by Point Set Matching
- OPTIMAL BSPs AND RECTILINEAR CARTOGRAMS
- Enhanced Model Formulations for Optimal Facility Layout
- Rectangular duals of planar graphs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Graph Drawing by Classical Multidimensional Scaling: New Perspectives
- Area-universal rectangular layouts
- Computing cartograms with optimal complexity
This page was built for publication: On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps
