Computational methods for logistics problems related to optimal trees

DOI10.1017/S1446181117000074MaRDI QIDQ5370788zbMATH OpenOpenAlexFDO

Authors Longshu Wu, Qin Wang, Xiao Bing Yang

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 methodnondeterministic polynomial-time (NP)-hardpolynomial algorithmspanning tree

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 795222
• Computer Algebra and Geometric Algebra with Applications
• Balanced spanning forests and trees
• The problem of the optimal biobjective spanning tree
• Efficient solution methods for covering tree problems

Cites work

• A linear time algorithm for optimal \(k\)-hop dominating set of a tree
• An inverse model for the most uniform problem
• Combinatorial optimization with one quadratic term: spanning trees and forests
• Combinatorial optimization. Theory and algorithms
• Constrained balanced optimization problems
• Efficient algorithms for travelling salesman problems arising in warehouse order picking
• scientific article; zbMATH DE number 7651946 (Why is no real title available?)
• Most and least uniform spanning trees
• On finding most uniform spanning trees
• Optimal pipe-sizing problem of tree-shaped gas distribution networks

Cited in

(3)

• scientific article; zbMATH DE number 2104840 (Why is no real title available?)
• Optimization of unbalanced multi-stage logistics systems based on priifer number and effective capacity coding
• Un algorithme de minimisation du transport à vide appliqué à l'industrie forestière

This page was built for publication: Computational methods for logistics problems related to optimal trees

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