Is Prüfer Code Encoding Always a Bad Idea?

DOI10.1007/978-3-319-99648-6_5zbMath1421.90176OpenAlexW2890330293MaRDI QIDQ5234020

D. Y. Atia, A. F. Isakovic, Dymitr Ruta, Hanno Hildmann

Publication date: 9 September 2019

Published in: Recent Advances in Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-99648-6_5

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The particle swarm optimization algorithm: Convergence analysis and parameter selection
• Developing new locality results for the Prüfer code using a remarkable linear-time decoding algorithm
• Permutation representation of k-ary trees
• A Production Line that Balances Itself

This page was built for publication: Is Prüfer Code Encoding Always a Bad Idea?