An efficient mixed integer linear programming model for the minimum spanning tree problem

DOI10.3390/math6100183zbMath1515.90064OpenAlexW2894175156WikidataQ129142240 ScholiaQ129142240MaRDI QIDQ6162004

Tamer F. Abdelmaguid

Publication date: 15 June 2023

Published in: Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/math6100183

zbMATH Keywords

combinatorial optimizationmathematical programmingminimum spanning tree

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05) Combinatorial optimization (90C27)

Related Items (1)

Improved approaches to solve the one-to-one skewgram problem

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Integer Programming Formulation of Traveling Salesman Problems
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient mixed integer linear programming model for the minimum spanning tree problem