An improved upper bound for the zero-one knapsack problem. A note on the paper by Martello and Toth

DOI10.1016/0377-2217(78)90096-6zbMath0379.90077OpenAlexW1494745371MaRDI QIDQ1247256

Heiner Müller-Merbach

Publication date: 1978

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(78)90096-6

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (1)

Exact methods for the knapsack problem and its generalizations

Cites Work

• Unnamed Item
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• A Branch Search Algorithm for the Knapsack Problem
• Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems

This page was built for publication: An improved upper bound for the zero-one knapsack problem. A note on the paper by Martello and Toth