The dual branch and bound method

zbMath1036.90563MaRDI QIDQ1422691

A. V. Kosenko

Publication date: 25 February 2004

Published in: Vestnik St. Petersburg University. Mathematics (Search for Journal in Brave)

zbMATH Keywords

knapsack problemdiscrete optimizationallocation problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

This page was built for publication: The dual branch and bound method