1-Segment Center Problems

DOI10.1287/IJOC.4.4.426MaRDI QIDQ4024314zbMATH OpenOpenAlexFDO

Authors

Publication date 25 February 1993

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.4.4.426

zbMATH Keywords

prune-and-searchminimax facility location

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• Computing an obnoxious anchored segment.
• scientific article; zbMATH DE number 1003238
• Computing a Segment Center for a Planar Point Set
• A near-linear algorithm for the planar segment-center problem
• Some constrained minimax and maximin location problems

Cited in

(8)

• Continuous center problems
• Location of rectilinear center trajectories
• Locational optimization problems solved through Voronoi diagrams
• Special issue on Locational analysis
• Continuous location of dimensional structures.
• Computing an obnoxious anchored segment.
• A near-linear algorithm for the planar segment-center problem
• Minmax-distance approximation and separation problems: geometrical properties

This page was built for publication: 1-Segment Center Problems

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