Author:
Bernáth Attila,Ciebiera Krzysztof,Godlewski Piotr,Sankowski Piotr
Publisher
Springer International Publishing
Reference16 articles.
1. Andrade, R., Lucena, A., Maculan, N.: Using Lagrangian dual information to generate degree constrained spanning trees. Discrete Appl. Math. 154(5), 703–717 (2006),
http://www.sciencedirect.com/science/article/pii/S0166218X0500301X
2. Boldon, B., Deo, N., Kumar, N.: Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine. Parallel Comput. 22(3), 369–382 (1996)
3. CPLEX, I.I.: High performance mathematical programming engine,
http://www-01.ibm.com/software/integration/optimization/cplex-optimizer
4. Deo, N., Hakimi, S.: The shortest generalized hamiltonian tree. In: Proceedings of the 6th Annual Allerton Conference, pp. 879–888. University of Illinois, Illinois (1968)
5. Edmonds, J.: Matroids and the greedy algorithm. Math. Program. 1(1), 127–136 (1971)