scientific article; zbMATH DE number 3892936

MaRDI QIDQ5184673zbMATH OpenFDO

Authors Yu. P. Laptin

Publication date 1984

zbMATH Keywords

branch-and-bound methodsheuristic proceduresprobabilistic analysissearch on stochastic trees

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Mixed integer programming (90C11)

Recommendations

• A branch and bound method for stochastic integer problems under probabilistic constraints
• Asymptotic Behavior of Optimal Solutions in Stochastic Programming
• scientific article; zbMATH DE number 1199856
• scientific article; zbMATH DE number 1419370
• Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search
• Probabilistic bounds (via large deviations) for the solutions of stochastic programming problems
• Asymptotic Theory for Solutions in Statistical Estimation and Stochastic Programming
• Probabilistic asymptotic properties of some combinatorial optimization problems
• Asymptotic behavior of statistical estimators and of optimal solutions of stochastic optimization problems

Cited in

(2)

• Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search
• Probabilistic subproblem selection in branch-and-bound algorithms

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 Q5184673)