Concepedia

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

Francesco Carrabs, Raffaele Cerulli, Rosa Pentangelo, Andrea Raiconi

Annals of Operations Research · 2018 · 37 citations · 8 references

DOI

Concepts

References

8

The Knapsack Problem with Conflict Graphs

Ulrich Pferschy, Joachim Schauer · Journal of Graph Algorithms and Applications · 2009 · 138 citations · Full text

, , +16

Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm

Ruslan Sadykov, François Vanderbeck · INFORMS journal on computing · 2012 · 137 citations

, , +16

Paths, trees and matchings under disjunctive constraints

Andreas Darmann, Ulrich Pferschy, Joachim Schauer et al. · Discrete Applied Mathematics · 2011 · 97 citations

, , +10

Matrices with the edmonds—Johnson property

A.M.H. Gerards, Alexander Schrijver · COMBINATORICA · 1986 · 85 citations

, , +10

The minimum spanning tree problem with conflict constraints and its variations

Ruonan Zhang, Santosh N. Kabadi, Abraham P. Punnen · Discrete Optimization · 2010 · 76 citations

, , +14