A polynomial algorithm for the multicriteria cent-dian location problem

DOI10.1016/J.EJOR.2005.11.042MaRDI QIDQ864019zbMATH OpenOpenAlexFDO

Authors Marcos Colebrook, J. Sicilia

Publication date 12 February 2007

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2005.11.042

zbMATH Keywords

cent-dian problemlocationmultiple criteria analysis

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Discrete location and assignment (90B80) Programming involving graphs or networks (90C35)

Recommendations

• The multicriteria \(p\)-facility median location problem on networks
• Efficient points in the biobjective cent-dian problem
• The centdian subtree on tree networks
• Multicriteria network location problems with sum objectives
• A polynomial algorithm for thep-centdian problem on a tree

Cites work

• A multi-objective model for locating fire stations
• A Multiobjective Approach to Design Franchise Outlet Networks
• Algorithms for path medi-centers of a tree
• Duality in the Cent-Dian of a Graph
• Efficient points in the biobjective cent-dian problem
• Fibonacci heaps and their uses in improved network optimization algorithms
• Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
• Finding the upper envelope of n line segments in O(n log n) time
• From the median to the generalized center
• scientific article; zbMATH DE number 1253064 (Why is no real title available?)
• scientific article; zbMATH DE number 1368469 (Why is no real title available?)
• Locating a facility on a network with multiple median-type objectives
• Medi-Centers of a Tree
• Medi-centre Location Problems
• Multicriteria network location problems with sum objectives
• Multicriteria ranking of alternative locations for small scale hydro plants
• On cent-dians of general networks
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

Cited in

(13)

• Optimality conditions in preference-based spanning tree problems
• Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
• The biobjective absolute center problem
• The multicriteria \(p\)-facility median location problem on networks
• An algorithm for solving the bi-objective median path-shaped facility on a tree network
• Efficient points in the biobjective cent-dian problem
• A geometric characterisation of the quadratic min-power centre
• Centroidal Power Diagrams, Lloyd's Algorithm, and Applications to Optimal Location Problems
• From the median to the generalized center
• Multicriteria network location problems with sum objectives
• scientific article; zbMATH DE number 5691661 (Why is no real title available?)
• The weighted center and weighted median of network location
• Multiple criteria facility location problems: a survey

Describes a project that uses

Uses Software

• LEDA

This page was built for publication: A polynomial algorithm for the multicriteria cent-dian location problem

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