An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
From MaRDI portal
Recommendations
- An exact algorithm for 0-1 polynomial Knapsack problems
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- 0-1 knapsack problems
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
Cited in
(26)- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
- The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
- Bi-dimensional knapsack problems with one soft constraint
- 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
- An exact algorithm for bilevel 0-1 knapsack problems
- A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem
- When two-constraint binary knapsack problem is equivalent to classical knapsack problem?
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Minimizing the number of tardy jobs in two-machine settings with common due date
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
- Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
- An exact algorithm for 0-1 polynomial Knapsack problems
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem
- An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs
- CORAL: an exact algorithm for the multidimensional knapsack problem
- An exact algorithm for the budget-constrained multiple knapsack problem
- Remarks on 0-1 optimization problems with superincreasing and superdecreasing objective functions
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- An 0 (n^3) worst case bounded special LP knapsack (0-1) with two constraints
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- 0-1 knapsack problems with a side constraint
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable
- Computational experience with a core-based reduction procedure for the 2-knapsack problem
- Lower bounds and heuristic algorithms for the k_i-partitioning problem
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances
This page was built for publication: An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637393)
