An Exact Algorithm for the Two-Constraint 0--1 Knapsack Problem

Authors:
Silvano Martello;Paolo Toth
Affiliations:
-;-
Venue:
Operations Research
Year:
2003

Citing 0
Cited 8

Very Large-Scale Neighborhood Search for the K-Constraint Multiple Knapsack Problem

Journal of Heuristics
Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem

Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances

Journal of Scheduling
Shift-and-merge technique for the DP solution of the time-constrained backpacker problem

Computers and Operations Research
Optimizing quality of service in real-time systems under energy constraints

ACM SIGOPS Operating Systems Review
CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem

INFORMS Journal on Computing
Multicriteria 0-1 knapsack problems with k-min objectives

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a knapsack problem in which each item has two types of weight and the container has two types of capacity. We discuss the surrogate, Lagrangian, and continuous relaxations, and give an effective method to determine the optimal Lagrangian and surrogate multipliers associated with the continuous relaxation of the problem. These results are used to obtain an exact branch-and-bound algorithm, which also includes heuristic procedures and a reduction technique. The performance of bounds and algorithms is evaluated through extensive computational experiments.