• Full Text
    • Scholarly Journal

    On Solving the Minimum Spanning Tree Problem with Conflicting Edge Pairs

    ; 
    . 
    ; Basel Vol. 18, Iss. 8,  (2025): 526.     DOI:10.3390/a18080526
    PDF CiteCite
    Copy URLPrintAll Options

    References (47)

    • 1.

      Solving the parallel drone scheduling traveling salesman problem via constraint programming

      Montemanni, R; DellAmico, M. Algorithms Vol. 16, Iss. 1, .
    • 2.

      Parallel drone scheduling vehicle routing problems with collective drones

      Montemanni, R; Dell'Amico, M; Corsini, A. Comput. Oper. Res Vol. 163, .
    • 3.

      Set covering problem with conflict constraints

      Saffari, S; Fathi, Y. Computers & Operations Research Vol. 143, .
    • 4.

      Exact solution algorithms for the maximum flow problem with additional conflict constraints

      Şuvak, Zeynep; Altınel, İ; Aras, Necati. European Journal of Operational Research Vol. 287, Iss. 2, .
    • 5.

      An algorithm for the disjunctively constrained Knapsack problem

      Hifi, M; Otmani, N. Int. J. Oper. Res Vol. 13, Iss. 1, .
    • 6.

      A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs

      Carrabs, Francesco; Gaudioso, Manlio. Networks Vol. 78, Iss. 1, .
    • 7.

      Iterated exact and heuristic algorithms for the minimum cost bipartite perfect matching problem with conflict constraints

      T. Öncan; I.K. Altınel. Proceedings of the 2017 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM).
    • 8.

      On Solving the Maximum Flow Problem with Conflict Constraints

      R. Montemanni; D.H. Smith. Proceedings of the 2025 Industrial Electronics and Applications Conference.
    • 9.

      Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving

      P.J. Stuckey. Proceedings of the International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming (CPAIOR).
    • 10.

      GEne Network Expansion. CPU Performance

      (2025).
    • 11.

      Google OR-Tools-CP-SAT

      L. Perron; F. Didier. (2025).
    • 12.

      Hybridizing Carousel Greedy and Kernel Search: A new approach for the maximum flow problem with conflict constraints

      F. Carrabs; R. Cerulli; R. Mansini; D. Serra; C. Sorgente. Eur. J. Oper. Res Vol. 324, (2025).
    • 13.

      Solving a Home Healthcare Routing and Scheduling Problem with Real-World Features

      R. Montemanni. Machine Learning and Soft Computing, Proceedings of International Conference on Machine Learning and Soft Computing, Tokyo, Japan, 24–26 January 2025(2025).
    • 14.

      Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP

      Carrabs, Francesco; Cerulli, Raffaele; Mansini, Renata; Moreschini, Lorenzo; Serra, Domenico. Computers and Operations Research; Elsevier Ltd Vol. 166, (Jun 2024).
    • 15.

      Shortest paths with exclusive-disjunction arc pairs conflicts

      R. Cerulli; G. Guerriero; E. Scalzo; C. Sorgente. Comput. Oper. Res Vol. 152, (2023).
    • 16.

      A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts

      S Coniglio; F Furini; P San Segundo. Eur J Oper Res Vol. 289, Iss. 2, (2021): 435-455.
    • 17.

      Branch and Bound and Dynamic Programming Approaches for the Path Avoiding Forbidden Pairs Problem

      D. Ferone; P. Festa; M. Salani; R. Cerulli; M. Dell’Amico; F. Guerriero; D. Pacciarelli; A. Sforza. Optimization and Decision Science: ODS, Virtual Conference, November 19, 2020(2021).
    • 18.

      Parameterized Complexity of Geometric Covering Problems Having Conflicts

      A. Banik; F. Panolan; V. Raman; V. Sahlot; S. Saurabh. Algorithmica Vol. 82, (2020).
    • 19.

      A multiethnic genetic approach for the minimum conflict weighted spanning tree problem

      Carrabs, Francesco; Cerrone, Carmine; Pentangelo, Rosa.  Networks; New York Vol. 74, Iss. 2,  (Sep 2019): 134-147.
    • 20.

      Minimum spanning tree with conflicting edge pairs: A branch-and-cut approach

      F. Carrabs; R. Cerulli; R. Pentangelo; A. Raiconi. Annals of Operations Research(2019).