The biobjective absolute center problem

DOI10.1007/BF02568548MaRDI QIDQ1383313zbMATH OpenOpenAlexFDO

Authors Rosa Ramos, J. Sicilia, Teresa Ramos

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

absolute center of a networkbiobjective absolute centernon-dominated location pointstransportation

Mathematics Subject Classification ID

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

Recommendations

• Efficient points in the biobjective cent-dian problem
• Biobjective center – balance graph location model^*
• A polynomial algorithm for the multicriteria cent-dian location problem

Cites work

• A polynomial time algorithm for finding the absolute center of a network
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An efficient algorithm for determining the convex hull of a finite planar set
• scientific article; zbMATH DE number 3847184 (Why is no real title available?)
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

Cited in

(3)

• Efficient points in the biobjective cent-dian problem
• scientific article; zbMATH DE number 4179135 (Why is no real title available?)
• Biobjective center – balance graph location model^*

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

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