COMPUTATIONAL METHODS FOR LOGISTICS PROBLEMS RELATED TO OPTIMAL TREES

DOI10.1017/S1446181117000074zbMath1373.90133OpenAlexW4238413717MaRDI QIDQ5370788

Qin Wang, Xiaobing Yang, Longshu Wu

Publication date: 20 October 2017

Published in: The ANZIAM Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1446181117000074

zbMATH Keywords

computational methodspanning treepolynomial algorithmnondeterministic polynomial-time (NP)-hard

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Optimal pipe-sizing problem of tree-shaped gas distribution networks
• Combinatorial optimization with one quadratic term: spanning trees and forests
• A linear time algorithm for optimal \(k\)-hop dominating set of a tree
• An inverse model for the most uniform problem
• Most and least uniform spanning trees
• On finding most uniform spanning trees
• Constrained balanced optimization problems
• EFFICIENT ALGORITHMS FOR TRAVELLING SALESMAN PROBLEMS ARISING IN WAREHOUSE ORDER PICKING
• Combinatorial optimization. Theory and algorithms

This page was built for publication: COMPUTATIONAL METHODS FOR LOGISTICS PROBLEMS RELATED TO OPTIMAL TREES