The least element property of center location on tree networks with applications to distance and precedence constrained problems

DOI10.1007/BF01585179zbMath0794.90030MaRDI QIDQ1319019

Arie Tamir

Publication date: 12 April 1994

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

semilattice; tree networks; \(p\)-center location; central depot on the network; least element property

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B80: Discrete location and assignment

Related Items

The average diameter of general tree structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Active set algorithms for isotonic regression; a unifying framework
• Representation of general and polyhedral subsemilattices and sublattices of product spaces
• Improved complexity bounds for location problems on the real line
• Locating service centers with precedence constraints
• A unifying location model on tree graphs based on submodularity property
• A faster parametric minimum-cut algorithm
• Isotonic Median Regression: A Linear Programming Approach
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Effective algorithm for the weber problem with a rectangular metric
• Multifacility Location Problem with Rectilinear Distance by the Minimum-Cut Approach
• Convex Location Problems on Tree Networks
• A Cut Approach to the Rectilinear Distance Facility Location Problem
• Distance Constraints for Tree Network Multifacility Location Problems