A problems of selecting a optimal path on network

MaRDI QIDQ3609329zbMATH OpenFDO

Authors Lin Liu

Publication date 6 March 2009

zbMATH Keywords

algorithms and complexitynetwork locationpoint-path distancepolynomial algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• The problems of selecting an optimal path on network
• Minisum amd minimax paths of a moving facility on a network
• Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations
• scientific article; zbMATH DE number 792650
• scientific article; zbMATH DE number 1766757

Cited in

(10)

• Minisum amd minimax paths of a moving facility on a network
• Optimization algorithms for resilient path selection in networks
• Path problems in networks
• Path Problems in Complex Networks
• scientific article; zbMATH DE number 1810469 (Why is no real title available?)
• The problems of selecting an optimal path on network
• Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations
• The 2-path network problem
• scientific article; zbMATH DE number 1766757 (Why is no real title available?)
• scientific article; zbMATH DE number 6393860 (Why is no real title available?)

This page was built for publication: A problems of selecting a optimal path on network

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