A linear program for points of interest relocation in adaptive maps

DOI10.1007/978-3-031-38299-4_57MaRDI QIDQ6179055zbMATH OpenOpenAlexFDO

Authors Simon B. Hengeveld, Frank Plastria, Antonio Mucherino, David A. Pelta

Publication date 16 January 2024

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-38299-4_57

zbMATH Keywords

distance geometry problemPOI relocation problem

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial aspects of finite geometries (05B25) Graph representations (geometric and intersection representations, etc.) (05C62) General theory of distance geometry (51K05) Metric geometry (51F99)

Recommendations

• Relocation-promotion problem with Euclidean distance
• Lagrangean relaxation with clusters for point-feature cartographic label placement problems
• The maximal expected coverage relocation problem for emergency vehicles
• A Fast Greedy Algorithm for the Relocation Problem
• Point placement on the line by distance data.

Cites work

• An alternative approach to distance geometry using \(L^\infty\) distances
• Distance Geometry
• Distance geometry in linearizable norms
• Euclidean distance geometry and applications
• New error measures and methods for realizing protein graphs from distance data

Cited in

(1)

• The stick model for distance geometry

This page was built for publication: A linear program for points of interest relocation in adaptive maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6179055)