Complete description for the spanning tree problem with one linearised quadratic term
暂无分享,去创建一个
[1] Temel Öncan,et al. The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm , 2010, Comput. Oper. Res..
[2] Christoph Buchheim,et al. Combinatorial optimization with one quadratic term: Spanning trees and forests , 2014, Discret. Appl. Math..
[3] Nair Maria Maia de Abreu,et al. A survey for the quadratic assignment problem , 2007, Eur. J. Oper. Res..
[4] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..
[5] Roberto Cordone,et al. Solving the Quadratic Minimum Spanning Tree Problem , 2012, Appl. Math. Comput..
[6] A. Assad,et al. The quadratic minimum spanning tree problem , 1992 .
[7] Jens Vygen,et al. The Book Review Column1 , 2020, SIGACT News.
[8] Christoph Buchheim,et al. The spanning tree problem with one quadratic term , 2013, CTW.
[9] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .