scientific article
From MaRDI portal
Publication:3115678
zbMath1249.90345MaRDI QIDQ3115678
Mikhail A. Posypkin, Roman M. Kolpakov
Publication date: 10 February 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60)
Related Items
Iterative MC-algorithm to solve the global optimization problems, Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem, Complexity of solving the subset sum problem with the branch-and-bound method with domination and cardinality filtering, On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method, Estimation of the number of iterations in integer programming algorithms using the regular partitions method, On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems, On the best choice of a branching variable in the subset sum problem
