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

DOI10.3390/MATH6100183MaRDI QIDQ6162004zbMATH OpenOpenAlexWikidataFDO

Authors Tamer F. Abdelmaguid

Publication date 15 June 2023

Published in Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

combinatorial optimizationmathematical programmingminimum spanning tree

Mathematics Subject Classification ID

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

Recommendations

• A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs
• A new relaxation method for the generalized minimum spanning tree problem
• A mixed integer linear formulation for the minimum label spanning tree problem
• New models of the generalized minimum spanning tree problem
• Solving the minimum label spanning tree problem by mathematical programming techniques

Cites work

• scientific article; zbMATH DE number 2132174 (Why is no real title available?)
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 795222 (Why is no real title available?)
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Integer Programming Formulation of Traveling Salesman Problems
• On the shortest spanning subtree of a graph and the traveling salesman problem
• The Traveling-Salesman Problem and Minimum Spanning Trees

Cited in

(9)

• Integer programming formulations for minimum spanning forests and connected components in sparse graphs
• Improved approaches to solve the one-to-one skewgram problem
• Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
• A note on “A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs”
• Collective combinatorial optimisation as judgment aggregation
• Solving the minimum label spanning tree problem by mathematical programming techniques
• Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
• A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs
• scientific article; zbMATH DE number 4173002 (Why is no real title available?)

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

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