k-Eccentricity and absolute k-centrum of a probabilistic tree
From MaRDI portal
Publication:800815
DOI10.1016/0377-2217(85)90315-7zbMath0551.90020OpenAlexW2045346218MaRDI QIDQ800815
Publication date: 1985
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(85)90315-7
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Convex programming (90C25) Stochastic programming (90C15) Inventory, storage, reservoirs (90B05)
Related Items
Worst-case incremental analysis for a class ofp-facility location problems, Two unconstrained optimization approaches for the Euclidean \(\kappa \)-centrum location problem, On \(k\)-sum optimization, On solving the planar \(k\)-centrum problem with Euclidean distances, k-sum optimization problems, Bridging \(k\)-sum and CVaR optimization in MILP, The \(k\)-centrum multi-facility location problem, Smoothing method for minimizing the sum of therlargest functions, Group centre and group median of a tree, The partial sum criterion for Steiner trees in graphs and shortest paths, An efficient algorithm for the Euclidean \(r\)-centrum location problem, Minimizing the sum of the \(k\) largest functions in linear time.
Cites Work
