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)

Review text

Given an undirected network with vertex weights, edge lengths and costs, the cent-dian problem consists of determining one facility on the network which minimizes a given convex combination of the maximum distance and the sum of distances (i.e. a combination of the center function and the median function is considered). The same is required for the function based on the edge costs. For this biobjective problem, the authors suggest a polynomial algorithm running in \(O(|V||E|\log|V|)\) time based on computational geometry, which determines all efficient points. The authors give several computational results.

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)