scientific article; zbMATH DE number 5503918

MaRDI QIDQ3596895zbMATH OpenFDO

Authors I. Kh. Sigal

Publication date 9 February 2009

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Recommendations

• Parameter estimation in branch and bound algorithms for large-scale discrete optimization problems
• Parametrization and investigation of some large-scale discrete programming problems
• Large-scale discrete programming problems: parametrization and analysis of \(\varepsilon\)-approximate algorithms
• Parallel branch, cut, and price for large-scale discrete optimization
• Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems
• scientific article; zbMATH DE number 4202061
• A branch and bound algorithm for solving a class of nonlinear integer programming problems
• scientific article; zbMATH DE number 1544632
• Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
• A branch and bound algorithm for a class of non-convex programming problems

Cited in

(4)

• scientific article; zbMATH DE number 1406246 (Why is no real title available?)
• Parametrization and investigation of some large-scale discrete programming problems
• Large-scale discrete programming problems: parametrization and analysis of \(\varepsilon\)-approximate algorithms
• Parameter estimation in branch and bound algorithms for large-scale discrete optimization problems

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