scientific article; zbMATH DE number 5022114
From MaRDI portal
Publication:5291118
zbMath1093.68142MaRDI QIDQ5291118
Kh. Sigal, Mikhail A. Posypkin
Publication date: 9 May 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Parallel algorithms in computer science (68W10)
Related Items (3)
Parallelization of the global extremum searching process ⋮ Experimental investigations of combined algorithms of branch and bound method and dynamic programming method for knapsack problems ⋮ A combined parallel algorithm for solving the knapsack problem
This page was built for publication: