scientific article; zbMATH DE number 2233211

zbMATH Open1095.90091MaRDI QIDQ5708306FDOQ5708306

Authors: Vladimir N. Burkov, Irina V. Burkova 

Publication date: 28 November 2005

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 617944
• On the problem of optimization of dynamic discrete-continuous processes
• Lösungsverfahren für eine klasse diskreter optimierungsaufgaben spezieller struktur
• The dual branch and bound method
• scientific article; zbMATH DE number 3976782

zbMATH Keywords

branches and bounds

Mathematics Subject Classification ID

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

Cited In (6)

• A discrete optimization method based on a parameterization of a Grassmannian in multidimensional dichotomous data structuring
• Analytical complexity and errors of solving control problems for organizational and technical systems
• A method of network programming in problems of nonlinear optimization
• Operations research applications of dichotomous search
• Models of the optimal resource allocation for the critical infrastructure protection
• OPTi's Algorithm for Discreteness Determination

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