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

[1]  Temel Öncan,et al.  The minimum cost perfect matching problem with conflict pair constraints , 2013, Comput. Oper. Res..

[2]  Abraham P. Punnen,et al.  The minimum spanning tree problem with conflict constraints and its variations , 2011, Discret. Optim..

[3]  Gilbert Laporte,et al.  The generalized minimum spanning tree problem: Polyhedral analysis and branch‐and‐cut algorithm , 2004, Networks.

[4]  Ruslan Sadykov,et al.  Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm , 2013, INFORMS J. Comput..

[5]  Ulrich Pferschy,et al.  The Knapsack Problem with Conflict Graphs , 2009, J. Graph Algorithms Appl..

[6]  Sebastián Urrutia,et al.  A branch and cut algorithm for minimum spanning trees under conflict constraints , 2013, Optim. Lett..

[7]  Gerhard J. Woeginger,et al.  Paths, trees and matchings under disjunctive constraints , 2011, Discret. Appl. Math..

[8]  Christian Laforest,et al.  Trees in Graphs with Conflict Edges or Forbidden Transitions , 2013, TAMC.

[9]  Raffaele Cerulli,et al.  OMEGA one multi ethnic genetic approach , 2016, Optim. Lett..

[10]  Ulrich Pferschy,et al.  The maximum flow problem with disjunctive constraints , 2013, J. Comb. Optim..

[11]  Raffaele Cerulli,et al.  Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach , 2018 .

[12]  Raffaele Cerulli,et al.  Bounded-degree spanning tree problems: models and new algorithms , 2009, Comput. Optim. Appl..

[13]  Raffaele Cerulli,et al.  Lower and upper bounds for the spanning tree with minimum branch vertices , 2013, Comput. Optim. Appl..

[14]  B D Latter,et al.  The island model of population differentiation: a general solution. , 1973, Genetics.

[15]  Raffaele Cerulli,et al.  Relations, models and a memetic approach for three degree-dependent spanning tree problems , 2014, Eur. J. Oper. Res..