Avoiding anomalies in the MT2 algorithm by Martello and Toth

DOI10.1016/0377-2217(94)00198-LzbMATH Open0905.90123WikidataQ58826523 ScholiaQ58826523MaRDI QIDQ1388884FDOQ1388884

Authors: David Pisinger 

Publication date: 2 February 1999

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

Recommendations

• Algorithmic Improvements to the Method of Martel and Aouni
• A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm
• scientific article; zbMATH DE number 820495
• Asymptotic normality of recursive algorithms via martingale difference arrays
• An Exact Solution Method for the MTSP
• A further improvement on approximating TTP-2
• A computational note on the Martello-Toth knapsack algorithm
• Computational aspects of ideal \((t, n)\)-threshold scheme of Chen, Laing, and Martin
• Avoiding breakdown and near-breakdown in Lanczos type algorithms
• Algorithms for measuring perturbality in matroid optimization

zbMATH Keywords

coreknapsack problembranch-and-boundlarge size 0-1 knapsack problems

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• An Algorithm for Large Zero-One Knapsack Problems
• A Minimal Algorithm for the 0-1 Knapsack Problem
• An expanding-core algorithm for the exact \(0-1\) knapsack problem
• A New Algorithm for the 0-1 Knapsack Problem

Cited In (2)

• A multi-criteria approach to approximate solution of multiple-choice knapsack problem
• A computational note on the Martello-Toth knapsack algorithm

Uses Software

• Knapsack

This page was built for publication: Avoiding anomalies in the \(MT2\) algorithm by Martello and Toth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1388884)