An extremal problem on random trees

DOI10.1007/BF01069644MaRDI QIDQ3923968zbMATH OpenOpenAlexFDO

Authors Yu. P. Laptin

Publication date 1981

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01069644

zbMATH Keywords

permutationpolynomial algorithmrandom treeoptimal strategybranch and bound methodstrategy optimizationnecessary and sufficient optimality conditiondiscrete programmingsequential statistical analysis

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Trees (05C05) Analysis of algorithms and problem complexity (68Q25)

Cites work

• scientific article; zbMATH DE number 3324347 (Why is no real title available?)
• Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
• Practical Solution of Large Mixed Integer Programming Problems with Umpire
• Theoretical comparisons of search strategies in branch-and-bound algorithms

Cited in

(1)

• The generation of random, binary unordered trees

This page was built for publication: An extremal problem on random trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3923968)