Distance-constrained multifacility minimax location problems on tree networks

DOI10.1002/NET.3230220104MaRDI QIDQ3989543zbMATH OpenOpenAlexFDO

Authors Erhan Erkut, Richard L. Francis, Arie Tamir

Publication date 28 June 1992

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230220104

zbMATH Keywords

multifacility minimax locationpolynomial algorithmstree network

Mathematics Subject Classification ID

Trees (05C05) Discrete location and assignment (90B80) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Locating Two Facilities on a Tree Subject to Distance Constraints
• scientific article; zbMATH DE number 1138452
• Optimal location of interconnected facilities on tree networks subject to distance constraints
• Technical Note—A Sequential Location Scheme for the Distance-Constrained Multifacility Location Problem on a Tree
• Facility location on a tree with maximum distance constraints

Cites work

• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Slowing down sorting networks to obtain faster sorting algorithms

Cited in

(24)

• An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree
• Facility location and the geometric minimum-diameter spanning tree.
• Minmax regret solutions for minimax optimization problems with uncertainty
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
• Simple multistage location problem on a treelike network
• Minmax \(p\)-traveling salesmen location problems on a tree
• Facility location on a tree with maximum distance constraints
• Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees
• Facility location with tree topology and radial distance constraints
• Public facility location using dispersion, population, and equity criteria
• An Analysis of Network Location Problems with Distance Constraints
• The general facility location problem with connectivity on trees
• The minimax multistop location problem on a tree
• Locating Two Facilities on a Tree Subject to Distance Constraints
• Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems
• The generalized P‐forest problem on a tree network
• Technical Note—A Sequential Location Scheme for the Distance-Constrained Multifacility Location Problem on a Tree
• scientific article; zbMATH DE number 1138452 (Why is no real title available?)
• MULTI-FACILITY LOCATION PROBLEM WITH NONINCREASING PIECEWISE LINEAR DEMAND ON A TREE
• Minisum multipurpose trip location problem on trees
• Parallel NC-algorithms for multifacility location problems with mutual communication and their applications
• Optimal location of interconnected facilities on tree networks subject to distance constraints
• A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint
• A truncated aggregate smoothing Newton method for minimax problems

This page was built for publication: Distance-constrained multifacility minimax location problems on tree networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3989543)