On Solving the Minimum Spanning Tree Problem with Conflicting Edge Pairs
Uloženo v:
| Vydáno v: | Algorithms vol. 18, no. 8 (2025), p. 526-544 |
|---|---|
| Hlavní autor: | |
| Další autoři: | |
| Vydáno: |
MDPI AG
|
| Témata: | |
| On-line přístup: | Citation/Abstract Full Text + Graphics Full Text - PDF |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 3243968242 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 1999-4893 | ||
| 024 | 7 | |a 10.3390/a18080526 |2 doi | |
| 035 | |a 3243968242 | ||
| 045 | 2 | |b d20250101 |b d20251231 | |
| 084 | |a 231333 |2 nlm | ||
| 100 | 1 | |a Montemanni Roberto |u Department of Sciences and Methods for Engineering, University of Modena and Reggio Emilia, 42122 Reggio Emilia, Italy | |
| 245 | 1 | |a On Solving the Minimum Spanning Tree Problem with Conflicting Edge Pairs | |
| 260 | |b MDPI AG |c 2025 | ||
| 513 | |a Journal Article | ||
| 520 | 3 | |a The Minimum Spanning Tree with Conflicting Edge Pairs is a generalization that adds conflict constraints to a classical optimization problem on graphs used to model several real-world applications. In recent years, several heuristic and exact approaches have been proposed to tackle this problem. In this paper, we present a mixed-integer linear program not previously applied to this problem, and we solve it with an open-source solver. Computational results for the benchmark instances commonly adopted in the literature of the problem are reported. The results indicate that the approach we propose obtains results aligned with those of the much more sophisticated approaches available, notwithstanding it being much simpler to implement. During the experimental campaign, six instances were closed for the first time, with nine improved best-known lower bounds and sixteen improved best-known upper bounds over a total of two hundred thirty instances considered. | |
| 653 | |a Mathematical programming | ||
| 653 | |a Lower bounds | ||
| 653 | |a Integer programming | ||
| 653 | |a Upper bounds | ||
| 653 | |a Graph theory | ||
| 653 | |a Optimization | ||
| 653 | |a Commodities | ||
| 653 | |a Variables | ||
| 653 | |a Approximation | ||
| 653 | |a Linear programming | ||
| 653 | |a Algorithms | ||
| 653 | |a Mixed integer | ||
| 653 | |a Heuristic | ||
| 653 | |a Traveling salesman problem | ||
| 700 | 1 | |a Smith, Derek H |u Faculty of Computing, Engineering and Science, University of South Wales, Pontypridd CF37 1DL, UK; derek.smith@southwales.ac.uk | |
| 773 | 0 | |t Algorithms |g vol. 18, no. 8 (2025), p. 526-544 | |
| 786 | 0 | |d ProQuest |t Engineering Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/3243968242/abstract/embedded/H09TXR3UUZB2ISDL?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text + Graphics |u https://www.proquest.com/docview/3243968242/fulltextwithgraphics/embedded/H09TXR3UUZB2ISDL?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/3243968242/fulltextPDF/embedded/H09TXR3UUZB2ISDL?source=fedsrch |