Variable neighborhood search for the vertex weighted k-cardinality tree problem-Reference-Cited by-同舟云学术

Variable neighborhood search for the vertex weighted k-cardinality tree problem

Published:2006-05 Issue:1 Volume:171 Page:74-84
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Brimberg J.,Urošević D.,Mladenović N.

Publisher

Elsevier BV

Subject

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

Reference15 articles.

1. Toward practical ‘neural’ computation for combinatorial optimization problems;Baum,1986

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

3. A new adaptive multi-start technique for combinatorial global optimizations;Boese;Operations Research Letters,1994

4. S.Y. Cheung and A. Kumar, Efficient quorumcast routing algorithms, in: Proceedings of INFOCOM’94, 1994, pp. 840–847.

5. K_TREE / K_SUBGRAPH: A program package for minimal weighted k-cardinality trees and subgraphs;Ehrgott;European Journal of Operational Research,1996

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

1. General variable neighborhood search for the parallel machine scheduling problem with two common servers;Optimization Letters;2022-09-10

2. Variable neighborhood search variants for Min-power symmetric connectivity problem;Computers & Operations Research;2017-02

3. Variable neighborhood search for the pharmacy duty scheduling problem;Computers & Operations Research;2014-11

4. Polyhedral results and a Branch-and-cut algorithm for the $$k$$ -cardinality tree problem;Mathematical Programming;2012-09-06

5. The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation;Discrete Applied Mathematics;2010-06