Revisiting dynamic programming for finding optimal subtrees in trees-Reference-Cited by-同舟云学术

Revisiting dynamic programming for finding optimal subtrees in trees

Published:2007-02 Issue:1 Volume:177 Page:102-115
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Blum Christian

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference29 articles.

1. M.J. Blesa, P. Moscato, F. Xhafa, A memetic algorithm for the minimum weighted k-cardinality tree subgraph problem, in: Proceedings of the Fourth Metaheuristics International Conference, vol. 1, 2001, pp. 85–90.

2. M.J. Blesa, F. Xhafa, A C++ implementation of tabu search for k-cardinality tree problem based on generic programming and component reuse, in: Net.ObjectDays 2000 Tagungsband, Erfurt, Germany, 2000, Net.ObjectDays-Forum, pp. 648–652.

3. New metaheuristic approaches for the edge-weighted k-cardinality tree problem;Blum;Computers & Operations Research,2005

4. Local search algorithms for the k-cardinality tree problem;Blum;Discrete Applied Mathematics,2003

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Weighted target set selection on trees and cycles;Networks;2020-09-10

2. Design of agile supply chains including the trade-off between number of partners and reliability;The International Journal of Advanced Manufacturing Technology;2018-05-29

3. A Survey on Modeling and Optimizing Multi-Objective Systems;IEEE Communications Surveys & Tutorials;2017

4. Ant Colony Optimization for the Minimum-Weight Rooted Arborescence Problem;Springer Handbook of Computational Intelligence;2015

5. A Hybrid-Heuristics Algorithm for k-Minimum Spanning Tree Problems;Lecture Notes in Electrical Engineering;2012-12-27