Efficient points in the biobjective cent-dian problem

MaRDI QIDQ2704990zbMATH OpenFDO

Authors Teresa Ramos, J. Sicilia, Rosa Ramos, Marcos Colebrook

Publication date 25 February 2002

Published in Studies in Locational Analysis (Search for Journal in Brave)

zbMATH Keywords

biobjective network otimizationcent-dian problemlocation analysis

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Multi-objective and goal programming (90C29)

Recommendations

• A polynomial algorithm for the multicriteria cent-dian location problem
• The biobjective absolute center problem
• From the median to the generalized center
• The bi-criteria doubly weighted center-median path problem on a tree
• A polynomial algorithm for thep-centdian problem on a tree

Cited in

(4)

• The biobjective absolute center problem
• A bi-objective approach to discrete cost-bottleneck location problems
• From the median to the generalized center
• A polynomial algorithm for the multicriteria cent-dian location problem

This page was built for publication: Efficient points in the biobjective cent-dian problem

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