A unifying location model on tree graphs based on submodularity property

DOI10.1016/0166-218X(93)90132-8zbMath0790.90050MaRDI QIDQ1314341

Arie Tamir

Publication date: 22 February 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

submodularityfacility locationpolynomial solvabilitysubtreeellipsoid approach

Mathematics Subject Classification ID

Trees (05C05) Discrete location and assignment (90B80)

Related Items

A quadratic time exact algorithm for continuous connected 2-facility location problem in trees, Cooperative location games based on the minimum diameter spanning Steiner subgraph problem, Locating tree-shaped facilities using the ordered median objective, The least element property of center location on tree networks with applications to distance and precedence constrained problems

Cites Work

• Unnamed Item
• Unnamed Item
• A minimum length covering subgraph of a network
• The location of central structures in trees
• Geometric algorithms and combinatorial optimization
• Optimal location of a path or tree on a network with cycles
• Maximal Direct Covering Tree Problems
• A minimum-length covering subtree of a tree
• The optimal location of a path or tree in a tree network
• Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
• A linear algorithm for a core of a tree
• On Locating a Facility to Service Areas within a Network