Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach

DOI10.1016/j.cor.2016.09.018zbMath1391.90050OpenAlexW2521368330MaRDI QIDQ1652097

Vanesa Guerrero, Dolores Romero Morales, Emilio Carrizosa

Publication date: 11 July 2018

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

Full work available at URL: https://research.cbs.dk/en/publications/f6c1b05c-6177-4183-b387-2fbebde02fee

zbMATH Keywords

large neighborhood searchdata visualizationproportionsdissimilaritiesbox-connectivity

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80)

Related Items (5)

On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps ⋮ Rejoinder on: ``Distance geometry and data science ⋮ On mathematical optimization for clustering categories in contingency tables ⋮ Visualizing data as objects by DC (difference of convex) optimization ⋮ Comments on: ``Distance geometry and data science

Uses Software

• AMPL
• CPLEX
• GVF
• IsoMatch

Cites Work

• Unnamed Item
• A second-order method for strongly convex \(\ell _1\)-regularization problems
• Optimal design of compact and functionally contiguous conservation management areas
• Supervised classification and mathematical optimization
• A large neighbourhood search heuristic for ship routing and scheduling with split loads
• On rectangular cartograms
• Cluster analysis and mathematical programming
• Hope: A genetic algorithm for the unequal area facility layout problem.
• On imposing connectivity constraints in integer programs
• Visualizing data as objects by DC (difference of convex) optimization
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
• An adaptive large neighborhood search heuristic for the pollution-routing problem
• A convex optimisation framework for the unequal-areas facility layout problem
• A new method to solve the fully connected reserve network design problem
• Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems
• Operations research and data mining
• Modern multidimensional scaling. Theory and applications.
• Optimal Selection of a Connected Reserve Network
• OPTIMAL BSPs AND RECTILINEAR CARTOGRAMS
• Enhanced Model Formulations for Optimal Facility Layout
• L’algebre de Boole et ses applications en recherche operationnelle
• Tree visualization with tree-maps
• Graph Drawing by Classical Multidimensional Scaling: New Perspectives
• Imposing Connectivity Constraints in Forest Planning Models
• Adjacency-Preserving Spatial Treemaps
• Computing cartograms with optimal complexity

This page was built for publication: Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach