The constraint is satisfied if $T$ is a minimum spanning tree of $G$, where the edge weights are specified by the entries of $W$. We develop algorithms that filter the domains of all variables to bound consistency.doi:10.1007/11889205_13Grégoire Dooms...
CP[TangWang[TangPC[TangSong[TangZJ[TangSpringer USMULTIMED TOOLS APPLC. Tang, C. Hou, P. Wang, and Z. Song, "Salient object detection using color spatial distribution and minimum spanning tree weight," Multimed. Tools Appl., pp. 1-16, 2015....
can also be applied to the MSST and the 2CP. We will refer to the diameter of the MDST of P as the tree diameter of P and we will abbreviate the minimum-diameter monopolar spanning tree by MDmST—analogously to the MDdST. 2 The Minimum-Sum Dipolar Spanning Tree ...
It is a special case of the Quadratic Minimum Spanning Tree Problem (QMSTP), for which quadratic costs are also applicable to pairs of non-adjacent edges. Both were first investigated by Assad and Xu (1992) and proven to be NP-Hard. QMSTP formulations, exact algorithms and heuristics were...
M. Leitner, "Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem," Computers & Operations Research, vol. 65, pp. 1 - 18, 2016. 77Leitner, M.: Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning ...
Approximation algorithms for combinatorial optimization: 5th international workshop, APPROX 2002, Rome, Italy, September 17-21, 2002 : proceedingsJ. Gudmundsson, H. Haverkort, S.-M. Park, C.-S. Shin, and A. Wolff, Facility location and the geometric minimum-diameter spanning tree, in Proc. ...
(2013). Critical edges/nodes for the minimum spanning tree problem: Complexity and approximation. Journal of Combinatorial Optimization, 26(1), 178–189. Google Scholar Butenko, S., & Wilhelm, W. (2006). Clique-detection models in computational biochemistry and genomics. European Journal of ...
Park, C.-S. Shin, and A. Wolff. Facility location and the geometric minimum-diameter spanning tree. In Proc. 5th Int. Workshop on Approx. Algorithms for Combinatorial Optimization (APPROX'02), vol. 2462 of Lecture Notes Comput. Sci., pp. 146-160. Springer-Verlag, 2002....
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Program. 1981, 20, 255–282. 20. Lofberg, J. YALMIP: A toolbox for modeling and optimization in MATLAB. In Proceedings of the IEEE International Conference on Robotics and Automation,...