Avoiding anomalies in the \(MT2\) algorithm by Martello and Toth

DOI10.1016/0377-2217(94)00198-LzbMath0905.90123WikidataQ58826523 ScholiaQ58826523MaRDI QIDQ1388884

David Pisinger

Publication date: 2 February 1999

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

zbMATH Keywords

branch-and-boundcoreknapsack problemlarge size 0-1 knapsack problems

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Boolean programming (90C09)

Related Items

A multi-criteria approach to approximate solution of multiple-choice knapsack problem

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• An expanding-core algorithm for the exact \(0-1\) knapsack problem
• A New Algorithm for the 0-1 Knapsack Problem
• An Algorithm for Large Zero-One Knapsack Problems
• A Minimal Algorithm for the 0-1 Knapsack Problem