An efficient mixed integer linear programming model for the minimum spanning tree problem
From MaRDI portal
Publication:6162004
DOI10.3390/MATH6100183zbMATH Open1515.90064OpenAlexW2894175156WikidataQ129142240 ScholiaQ129142240MaRDI QIDQ6162004FDOQ6162004
Publication date: 15 June 2023
Published in: Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/math6100183
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
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Integer Programming Formulation of Traveling Salesman Problems
- Title not available (Why is that?)
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Title not available (Why is that?)
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
- Improved approaches to solve the one-to-one skewgram problem
- 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
- Title not available (Why is that?)
- A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs
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)
