scientific article
From MaRDI portal
Publication:3720256
zbMath0591.90022MaRDI QIDQ3720256
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
treecomputational complexityfacility locationchordal graphspolynomial time algorithmscovering problemsp-mediantotally balanced matricesplant locationp-center problems
Programming involving graphs or networks (90C35) Inventory, storage, reservoirs (90B05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (7)
The hub location and routing problem ⋮ L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem ⋮ An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree ⋮ Discrete Convex Functions on Graphs and Their Algorithmic Applications ⋮ Discrete convexity and polynomial solvability in minimum 0-extension problems ⋮ Complexity results for the \(p\)-median problem with mutual communication ⋮ The least element property of center location on tree networks with applications to distance and precedence constrained problems
This page was built for publication:
