Minisum amd minimax paths of a moving facility on a network
From MaRDI portal
Publication:1186001
DOI10.1016/0305-0548(92)90086-KzbMath0745.90074MaRDI QIDQ1186001
Heung-Sun Park, Seong-In Kim, Hanif D. Sherali
Publication date: 28 June 1992
Published in: Computers \& Operations Research (Search for Journal in Brave)
single service facilitymoving service facilityoptimal path in a networkshortest-path algorithmssum of the farthest weighted distancessum of the weighted distances
Programming involving graphs or networks (90C35) Queues and service in operations research (90B22) Discrete location and assignment (90B80)
Related Items (2)
A simple variational problem for a moving vehicle ⋮ A review of extensive facility location in networks
Cites Work
- Unnamed Item
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
- A New Polynomially Bounded Shortest Path Algorithm
- Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations
This page was built for publication: Minisum amd minimax paths of a moving facility on a network
