Locating facilities which interact: Some solvable cases

DOI10.1007/BF02060472zbMath0790.90049OpenAlexW2031826430MaRDI QIDQ689235

Dilip Chhajed, Timothy J. Lowe

Publication date: 23 June 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02060472

zbMATH Keywords

polynomial time algorithmnode selectiontransport network\(m\)-mediangeneralized Halin graphsinteraction costslocation of new facilities

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Related Items

The multi-stripe travelling salesman problem ⋮ An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree ⋮ Complexity results for the \(p\)-median problem with mutual communication

Cites Work

• A solvable case of quadratic 0-1 programming
• Schedule synchronization for public transit networks
• Graph separation techniques for quadratic zero-one programming
• The traveling salesman problem in graphs with 3-edge cutsets
• A Dynamic Programming Approach to the Dominating Set Problem on k-Trees
• A quadratic programming model for product configuration optimization
• An Almost Linear-Time Algorithm for Graph Realization
• Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems
• A Separator Theorem for Planar Graphs
• Applications of a Planar Separator Theorem
• m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases
• Convex Location Problems on Tree Networks
• A Cut Approach to the Rectilinear Distance Facility Location Problem
• Distance Constraints for Tree Network Multifacility Location Problems
• Solving Structured Multifacility Location Problems Efficiently
• Dividing a Graph into Triconnected Components
• Unnamed Item