The biobjective absolute center problem

DOI10.1007/BF02568548zbMath0892.90120OpenAlexW1590601234MaRDI QIDQ1383313

Rosa Ramos, Teresa Ramos, Joaquín Sicilia

Publication date: 3 August 1998

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02568548

zbMATH Keywords

transportationabsolute center of a networkbiobjective absolute centernon-dominated location points

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient algorithm for determining the convex hull of a finite planar set
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• A polynomial time algorithm for finding the absolute center of a network
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: The biobjective absolute center problem