A polynomial algorithm for the multicriteria cent-dian location problem
From MaRDI portal
Publication:864019
DOI10.1016/j.ejor.2005.11.042zbMath1163.90596OpenAlexW2056203497MaRDI QIDQ864019
Joaquín Sicilia, Marcos Colebrook
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
Programming involving graphs or networks (90C35) Management decision making, including multiple objectives (90B50) Discrete location and assignment (90B80)
Related Items (5)
A geometric characterisation of the quadratic min-power centre ⋮ The multicriteria \(p\)-facility median location problem on networks ⋮ Multiple criteria facility location problems: a survey ⋮ An algorithm for solving the bi-objective median path-shaped facility on a tree network ⋮ Optimality conditions in preference-based spanning tree problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding the upper envelope of n line segments in O(n log n) time
- Locating a facility on a network with multiple median-type objectives
- A multi-objective model for locating fire stations
- Algorithms for path medi-centers of a tree
- Multicriteria ranking of alternative locations for small scale hydro plants
- Medi-centre Location Problems
- Medi-Centers of a Tree
- Duality in the Cent-Dian of a Graph
- From the median to the generalized center
- Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
- On cent-dians of general networks
- Multicriteria network location problems with sum objectives
- A Multiobjective Approach to Design Franchise Outlet Networks
- Fibonacci heaps and their uses in improved network optimization algorithms
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: A polynomial algorithm for the multicriteria cent-dian location problem
