Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations

DOI10.1287/TRSC.21.2.115zbMATH Open0631.90023OpenAlexW2052895059MaRDI QIDQ3768656FDOQ3768656

Authors: G. Handler, Oded Berman 

Publication date: 1987

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.21.2.115

Recommendations

• Minisum amd minimax paths of a moving facility on a network
• The problems of selecting an optimal path on network
• Optimal M/G/1 Server Location on a Network Having a Fixed Facility
• A problems of selecting a optimal path on network
• Variational Problems for Determining Optimal Paths of a Moving Facility

zbMATH Keywords

locationoptimal pathmoving service unitsingle service unit

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Cited In (14)

• A minimum length covering subgraph of a network
• Minisum amd minimax paths of a moving facility on a network
• The continuous maximum capacity path interdiction problem
• The problems of selecting an optimal path on network
• A problems of selecting a optimal path on network
• A linear time algorithm for the maximum capacity path problem
• Expanding maximum capacity path under weighted sum-type distances
• Optimal search path for service in the presence of disruptions
• Online learning for min-max discrete problems
• Minmax regret solutions for minimax optimization problems with uncertainty
• A review of extensive facility location in networks
• Variational Problems for Determining Optimal Paths of a Moving Facility
• A network-based model for transporting extremely hazardous materials
• Online learning of network bottlenecks via minimax paths

This page was built for publication: Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations

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