An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
From MaRDI portal
Publication:3637393
DOI10.1287/opre.51.5.826.16757zbMath1165.90575OpenAlexW2047182666MaRDI QIDQ3637393
Publication date: 9 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.51.5.826.16757
Related Items
Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem, Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems, Bi-dimensional knapsack problems with one soft constraint, Minimizing the number of tardy jobs in two-machine settings with common due date, An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs, Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem, A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem, A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem, Remarks on 0-1 Optimization Problems with Superincreasing and Superdecreasing Objective Functions, A new exact approach for the 0-1 collapsing knapsack problem, Shift-and-merge technique for the DP solution of the time-constrained backpacker problem, Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances, Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem, Computational experience with a core-based reduction procedure for the 2-knapsack problem, CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem, When two-constraint binary knapsack problem is equivalent to classical knapsack problem?
