Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems

Recommendations

Knapsack problems -- an overview of recent advances. I: Single knapsack problems
The quadratic knapsack problem -- a survey
Some new results on multi-dimension Knapsack problem
The multidimensional knapsack problem: structure and algorithms
Generalized quadratic multiple knapsack problem and two solution approaches
The multidimensional 0-1 knapsack problem: an overview.
A Note on Approximation Schemes for Multidimensional Knapsack Problems
The multiobjective multidimensional knapsack problem: a survey and a new approach
A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems
An approximate dynamic programming approach to multidimensional knapsack problems

Cites work

scientific article; zbMATH DE number 1728442 (Why is no real title available?)
scientific article; zbMATH DE number 5282967 (Why is no real title available?)
scientific article; zbMATH DE number 44282 (Why is no real title available?)
scientific article; zbMATH DE number 3639144 (Why is no real title available?)
scientific article; zbMATH DE number 544186 (Why is no real title available?)
scientific article; zbMATH DE number 6869279 (Why is no real title available?)
scientific article; zbMATH DE number 2086630 (Why is no real title available?)
scientific article; zbMATH DE number 2107164 (Why is no real title available?)
0-1 quadratic knapsack problem solved with VNS algorithm
0-1 quadratic knapsack problems: an exact approach based on a \(t\)-linearization
2D knapsack: packing squares
A 3/4-approximation algorithm for multiple subset sum
A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem
A Lexicographic 0.5-Approximation Algorithm for the Multiple Knapsack Problem
A PTAS for the multiple subset sum problem with different knapsack capacities
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
A binary multiple knapsack model for single machine scheduling with machine unavailability
A bound and bound algorithm for the zero-one multiple knapsack problem
A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints
A branch-and-bound algorithm for hard multiple knapsack problems
A branch-and-bound algorithm for the quadratic multiple knapsack problem
A column generation method for the multiple-choice multi-dimensional knapsack problem
A column-generation approach to the multiple knapsack problem with color constraints
A computational study on the quadratic knapsack problem with multiple constraints
A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the Knapsack problem
A cut-and-branch algorithm for the quadratic knapsack problem
A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
A dynamic programming heuristic for the quadratic knapsack problem
A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems
A genetic algorithm for the multidimensional knapsack problem
A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
A hybrid evolutionary algorithm for the two-dimensional packing problem
A hybrid evolutionary search for the generalized quadratic multiple knapsack problem
A hybrid genetic algorithm for the two-dimensional single large object placement problem
A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem
A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
A logarithmic descent direction algorithm for the quadratic knapsack problem
A matheuristic for the 0--1 generalized quadratic multiple knapsack problem
A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
A multi-level search strategy for the 0-1 multidimensional knapsack problem
A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
A new ant colony optimization algorithm for the multidimensional Knapsack problem
A new upper bound for the 0-1 quadratic knapsack problem
A new upper bound for the multiple knapsack problem
A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments
A note on a two dimensional knapsack problem with unloading constraints
A note on optimal solutions to quadratic knapsack problems
A partheno-genetic algorithm for dynamic 0-1 multidimensional Knapsack problem
A population heuristic for constrained two-dimensional non-guillotine cutting
A procedure-based heuristic for 0-1 multiple knapsack problems
A randomized heuristic repair for the multidimensional knapsack problem
A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
A successive approximation algorithm for the multiple knapsack problem
A tabu search algorithm for a two-dimensional non-guillotine cutting problem
A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem
A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
Adaptive memory search for multidemand multidimensional knapsack problems
Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
An EDA for the 2D knapsack problem with guillotine constraint
An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
An adaptive population multi-objective quantum-inspired evolutionary algorithm for multi-objective 0/1 knapsack problems
An ant colony optimization approach for the multidimensional knapsack problem
An application of the multiple knapsack problem: the self-sufficient marine
An approximation scheme for the two-stage, two-dimensional knapsack problem
An effective GRASP and tabu search for the 0-1 quadratic knapsack problem
An ejection chain approach for the quadratic multiple knapsack problem
An exact algorithm for the budget-constrained multiple knapsack problem
An exact algorithm for the fixed-charge multiple knapsack problem
An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics
An iterated ``hyperplane exploration approach for the quadratic knapsack problem
An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem
An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem
An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
Approximation algorithms for orthogonal packing problems for hypercubes
Approximation and online algorithms for multidimensional bin packing: a survey
Approximation of the quadratic knapsack problem
Approximation of the quadratic knapsack problem
Approximation schemes for \(r\)-weighted minimization knapsack problems
Asymptotic behavior of the quadratic knapsack problem
Bin completion algorithms for multicontainer packing, Knapsack, and covering problems
CORAL: an exact algorithm for the multidimensional knapsack problem
Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems
Computational experience with a core-based reduction procedure for the 2-knapsack problem
Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems
Dynamic programming algorithms for the bi-objective integer knapsack problem
Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
Emergency relocation of items using single trips: special cases of the multiple knapsack assignment problem
Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems
Exact Solution of the Quadratic Knapsack Problem
Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
Exact solution of bin-packing problems using column generation and branch-and-bound
Exact solution techniques for two-dimensional cutting and packing
Faster Approximation Schemes for the Two-Dimensional Knapsack Problem
Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
Generalized quadratic multiple knapsack problem and two solution approaches
Grids for cutting and packing problems: a study in the 2D knapsack problem
Hard multidimensional multiple choice knapsack problems, an empirical study
Heuristic algorithms for the general nonlinear separable knapsack problem
Heuristic algorithms for the multiple-choice multidimensional knapsack problem
Heuristic approaches for the two- and three-dimensional knapsack packing problem
Heuristics for the 0-1 multidimensional knapsack problem
Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem
Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
Improved convergent heuristics for the 0-1 multidimensional knapsack problem
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
Improved results on the 0--1 multidimensional knapsack problem
Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities
Intelligent water drops algorithm
Irregular packing problems: a review of mathematical models
Iterated responsive threshold search for the quadratic multiple knapsack problem
Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
Kernel search: a general heuristic for the multi-dimensional knapsack problem
Knapsack problems -- an overview of recent advances. I: Single knapsack problems
Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
Lagrangian heuristics for the quadratic knapsack problem
Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
Lower and upper bounds for the non-linear generalized assignment problem
Mathematical models and decomposition methods for the multiple knapsack problem
Maximizing the total profit of rectangles packed into a rectangle
Merging valid inequalities over the multiple knapsack polyhedron
Model and algorithms for multi-period sea cargo mix problem
Models and algorithms for packing rectangles into the smallest square
Multicriteria 0-1 knapsack problems with \(k\)-min objectives
Multicriteria Optimization
Multiple criteria dynamic programming and multiple knapsack problem
Multiple subset sum with inclusive assignment set restrictions
New greedy heuristics for the multiple-choice multi-dimensional knapsack problem
New reduction strategy in the biobjective knapsack problem
On separating cover inequalities for the multidimensional knapsack problem
On the approximability of the two-phase knapsack problem
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
On the two-dimensional knapsack problem
Online knapsack of unknown capacity. How to optimize energy consumption in smartphones
Online knapsack problem under concave functions
Online knapsack revisited
Online knapsack with resource augmentation
Online minimization knapsack problem
Online removable knapsack problem under convex function
Online removable knapsack with limited cuts
Online unweighted knapsack problem with removal cost
Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
Packing groups of items into multiple knapsacks
Packing into the smallest square: worst-case analysis of lower bounds
Parameterized approximation scheme for the multiple knapsack problem
Parametric convex quadratic relaxation of the quadratic knapsack problem
Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
Randomized algorithms for online knapsack problems
Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
Relaxations and heuristics for the multiple non-linear separable knapsack problem
Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
Scatter search for the 0-1 multidimensional knapsack problem
Solution of large quadratic knapsack problems through aggressive reduction
Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm
Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
Solving the linear multiple choice knapsack problem with two objectives: Profit and equity
Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
Strategic oscillation for the quadratic multiple knapsack problem
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints
The assignment and loading transportation problem
The multidimensional 0-1 knapsack problem -- bounds and computational aspects
The multidimensional 0-1 knapsack problem: an overview.
The multidimensional knapsack problem: structure and algorithms
The multiobjective multidimensional knapsack problem: a survey and a new approach
The multiple multidimensional knapsack with family-split penalties
The multiple subset sum problem
The nonlinear knapsack problem - algorithms and applications
The online knapsack problem with incremental capacity
The online knapsack problem: advice and randomization
The quadratic knapsack problem -- a survey
The symmetric quadratic knapsack problem: approximation and scheduling applications
The three-dimensional knapsack problem with balancing constraints
Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints
Towards strong duality in integer programming
Two-dimensional knapsack-block packing problem
Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
Upper and lower bounding procedures for the multiple knapsack assignment problem
Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem
Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem
Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem

Cited in

(30)

The multidimensional 0-1 knapsack problem: an overview.
A lifted-space dynamic programming algorithm for the quadratic knapsack problem
Knapsack: connectedness, path, and shortest-path
LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis
On a cube and subspace projections
Generalization of the subset sum problem and cubic forms
scientific article; zbMATH DE number 719668 (Why is no real title available?)
The multidimensional 0-1 knapsack problem -- bounds and computational aspects
Learning-based multi-objective evolutionary algorithm for batching decision problem
Knapsack problems with position-dependent item weights or profits
The quadratic knapsack problem -- a survey
The knapsack problem with forfeit sets
Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items
Cutting and packing problems under uncertainty: literature review and classification framework
Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints
Greedy heuristic guided by lexicographic excellence
A survey of effective heuristics and their application to a variety of knapsack problems
A decomposition approach for multidimensional knapsacks with family‐split penalties
Improved approximation for two-dimensional vector multiple knapsack
Lagrangian matheuristics for the quadratic multiple knapsack problem
A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
scientific article; zbMATH DE number 2107164 (Why is no real title available?)
Distributed asynchronous column generation
Knapsack problems -- an overview of recent advances. I: Single knapsack problems
Mathematical models and decomposition methods for the multiple knapsack problem
Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits
Approximating single- and multi-objective nonlinear sum and product knapsack problems
Branch-and-price algorithms for large-scale mission-oriented maintenance planning problems
Generic polynomial algorithms for the knapsack problem in some matrix semigroups

Describes a project that uses

Uses Software

Knapsack
mkc7

This page was built for publication: Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems

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