Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
From MaRDI portal
Publication:4147891
DOI10.1287/mnsc.24.5.535zbMath0371.90120OpenAlexW2080725961MaRDI QIDQ4147891
Publication date: 1978
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.24.5.535
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Operations research and management science (90B99)
Related Items (35)
A bi-objective approach to discrete cost-bottleneck location problems ⋮ Multiple sink location problem in path networks with a combinational objective ⋮ Worst-case incremental analysis for a class ofp-facility location problems ⋮ An extended covering model for flexible discrete and equity location problems ⋮ Multiobjective analysis of facility location decisions ⋮ Axiomatic considerations in multi-objective location theory ⋮ The Connected p-Centdian Problem on Block Graphs ⋮ A polynomial algorithm for the multicriteria cent-dian location problem ⋮ Algorithms for central-median paths with bounded length on trees ⋮ Extensive facility location problems on networks: an updated review ⋮ Group centre and group median of a network ⋮ Using \(\ell^p\)-norms for fairness in combinatorial optimisation ⋮ Revisiting \(k\)-sum optimization ⋮ A kernel search heuristic for a fair facility location problem ⋮ A discretizing algorithm for location problems ⋮ A linear time algorithm for connected \(p\)-centdian problem on block graphs ⋮ The probabilistic \(p\)-center problem: planning service for potential customers ⋮ Approximability results for the $p$-centdian and the converse centdian problems ⋮ A multicriteria approach to the location of public facilities ⋮ Unimodal eccentricity in trees ⋮ The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction ⋮ New perspectives in competitive location theory ⋮ Reducibility of minimax to minisum 0-1 programming problems ⋮ Comparative error bound theory for three location models: continuous demand versus discrete demand ⋮ Bridging \(k\)-sum and CVaR optimization in MILP ⋮ Maintaining centdians in a fully dynamic forest with top trees ⋮ Unnamed Item ⋮ The 2-radius and 2-radiian problems on trees ⋮ The generalized \(p\)-centdian on network ⋮ Algorithms for connected \(p\)-centdian problem on block graphs ⋮ The obnoxious \(p\) facility network location problem with facility interaction ⋮ Inequality measures and equitable approaches to location problems ⋮ A geometrical solution for quadratic bicriteria location models ⋮ Minimizing the sum of the \(k\) largest functions in linear time. ⋮ The centdian subtree on tree networks
This page was built for publication: Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
