Pages that link to "Item:Q864019"
From MaRDI portal
The following pages link to A polynomial algorithm for the multicriteria cent-dian location problem (Q864019):
Displaying 12 items.
- A geometric characterisation of the quadratic min-power centre (Q297177) (← links)
- Multiple criteria facility location problems: a survey (Q988401) (← links)
- Optimality conditions in preference-based spanning tree problems (Q1027614) (← links)
- Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints (Q1284596) (← links)
- The biobjective absolute center problem (Q1383313) (← links)
- The multicriteria \(p\)-facility median location problem on networks (Q2256313) (← links)
- An algorithm for solving the bi-objective median path-shaped facility on a tree network (Q2305157) (← links)
- Efficient points in the biobjective cent-dian problem (Q2704990) (← links)
- Centroidal Power Diagrams, Lloyd's Algorithm, and Applications to Optimal Location Problems (Q3453960) (← links)
- From the median to the generalized center (Q3971961) (← links)
- Multicriteria network location problems with sum objectives (Q4242779) (← links)
- (Q5306630) (← links)