Publications by Benny Kjær Nielsen

Classified by Publication Type

J. Egeblad, B. K. Nielsen, and A. Odgaard. Fast neighborhood search for two- and three-dimensional nesting problems. European Journal of Operational Research, 183(3):1249–1266, 2007. [BibTeX] [doi]
M. Brazil, B. K. Nielsen, P. Winter, and M. Zachariasen. Rotationally Optimal Spanning and Steiner Trees in Uniform Orientation Metrics. Computational Geometry: Theory and Applications, 29:251–263, 2004. [BibTeX] [doi]
B. K. Nielsen, P. Winter, and M. Zachariasen. On the Location of Steiner Points in Uniformly-Oriented Steiner Trees. Information Processing Letters, 83:237–241, 2002. [BibTeX] [doi]

B. K. Nielsen. An efficient solution method for relaxed variants of the nesting problem. In Thirteenth Computing: The Australasian Theory Symposium (CATS2007), pp. 123–130, ACS, Ballarat, Australia, 2007. [BibTeX] [pdf]
B. K. Nielsen, S. Lindgreen, P. Winter, and M. Zachariasen. Deferred Path Heuristic for Phylogenetic Trees Revisited. In CompBioNets 2005: Algorithmics and Computational Methods for Biochemical and Evolutionary Networks, pp. 75–92, College Publications, King's College London, Strand, London, 2005. [BibTeX] [pdf]
B. K. Nielsen, P. Winter, and M. Zachariasen. Rectilinear Trees under Rotation and Related Problems. In Proceedings of the 18th European Workshop on Computational Geometry, pp. 18–22, 2002. [BibTeX] [ps]
B. K. Nielsen, P. Winter, and M. Zachariasen. An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem. In Proceedings of the 10th European Symposium on Algorithms, Lecture Notes in Computer Science, pp. 760–772, Springer, 2002. [BibTeX] [html]

B. K. Nielsen and A. Odgaard. Fast Neighborhood Search for the Nesting Problem. Technical Report 03/03, Department of Computer Science, University of Copenhagen, 2003. [BibTeX] [pdf]

Generated by bib2html.pl (written by Patrick Riley ) on Mon Jul 30, 2007 09:06:08