scientific article; zbMATH DE number 3947999

MaRDI QIDQ3718484zbMATH OpenFDO

Authors Stefano Pallottino, Tommaso Toffoli

Publication date 1979

zbMATH Keywords

efficiency estimationefficiency of branch-and-bound optimization algorithmslength of the longest dead pathLIFO tree search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Recommendations

• Parameter estimation in branch and bound algorithms for large-scale discrete optimization problems
• scientific article; zbMATH DE number 3948312
• scientific article; zbMATH DE number 646750
• A measure for the lexicographically first maximal independent set problem and its limits
• Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search

This page was built for publication:

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