Author:
Brimberg Jack,Mladenović Nenad,Urošević Dragan
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,Control and Optimization,Computer Networks and Communications,Information Systems,Software
Reference12 articles.
1. Baum, B.E.: Toward practical ‘neural’ computation for combinatorial optimization problems. In: Deker, J. (ed.) Neural Networks for Computing. American Institute of Physics, New York (1986)
2. Blum, C., Ehrgott, M.: Local search algorithms for the k-cardinality tree problem. Discrete Appl. Math. 128(2-3), 511–540 (2003)
3. Ehrgott, M.: Optimization problems in graphs under cardinality restrictions (in German). Master’s thesis, University of Kaiserslautern, Department of Mathematics (1992)
4. Ehrgott, M., Freitag, J.: K_TREE/K_SUBGRAPH: a program package for minimum weighted K-cardinality trees and subgraphs. Eur. J. Oper. Res. 93(1), 224–225 (1996)
5. Fischetti, M., Hamacher, H., Jörnsten, K., Maffioli, F.: Weighted k-cardinality trees: complexity and polyhedral structure. Networks 24, 11–21 (1994)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献