Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
From MaRDI portal
Publication:2147011
DOI10.1016/j.cor.2021.105693OpenAlexW4210457632MaRDI QIDQ2147011
Alberto Locatelli, Manuel Iori, Valentina Cacchiani, Silvano Martello
Publication date: 22 June 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105693
surveycombinatorial optimizationmultiple and multidimensional knapsack problemsquadratic knapsack problems
Related Items
Knapsack problems -- an overview of recent advances. I: Single knapsack problems, Generalization of the subset sum problem and cubic forms, Lagrangian matheuristics for the quadratic multiple knapsack problem, A lifted-space dynamic programming algorithm for the quadratic knapsack problem, Distributed asynchronous column generation, Cutting and packing problems under uncertainty: literature review and classification framework, Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items, Approximating single- and multi-objective nonlinear sum and product knapsack problems, Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints, The knapsack problem with forfeit sets, Branch-and-price algorithms for large-scale mission-oriented maintenance planning problems, LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup, Knapsack problems with position-dependent item weights or profits, A decomposition approach for multidimensional knapsacks with family‐split penalties, Learning-based multi-objective evolutionary algorithm for batching decision problem
Uses Software
Cites Work
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- Two-dimensional knapsack-block packing problem
- Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
- Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- Exact solution techniques for two-dimensional cutting and packing
- The multiple multidimensional knapsack with family-split penalties
- The assignment and loading transportation problem
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
- A matheuristic for the 0--1 generalized quadratic multiple knapsack problem
- A branch-and-bound algorithm for the quadratic multiple knapsack problem
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
- A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
- A hybrid evolutionary search for the generalized quadratic multiple knapsack problem
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
- An ant colony optimization approach for the multidimensional knapsack problem
- On the approximability of the two-phase knapsack problem
- Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems
- Irregular packing problems: a review of mathematical models
- A logarithmic descent direction algorithm for the quadratic knapsack problem
- Approximation schemes for \(r\)-weighted minimization knapsack problems
- Online knapsack problem under concave functions
- Parametric convex quadratic relaxation of the quadratic knapsack problem
- A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments
- Iterated responsive threshold search for the quadratic multiple knapsack problem
- A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
- Approximation and online algorithms for multidimensional bin packing: a survey
- Online knapsack of unknown capacity. How to optimize energy consumption in smartphones
- An EDA for the 2D knapsack problem with guillotine constraint
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
- The online knapsack problem: advice and randomization
- Strategic oscillation for the quadratic multiple knapsack problem
- Online removable knapsack problem under convex function
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- New greedy heuristics for the multiple-choice multi-dimensional knapsack problem
- Adaptive memory search for multidemand multidimensional knapsack problems
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
- Towards strong duality in integer programming
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
- Upper and lower bounding procedures for the multiple knapsack assignment problem
- Merging valid inequalities over the multiple knapsack polyhedron
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- 0-1 quadratic knapsack problem solved with VNS algorithm
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
- Lower and upper bounds for the non-linear generalized assignment problem
- A new upper bound for the multiple knapsack problem
- A cut-and-branch algorithm for the quadratic knapsack problem
- The Multiple Subset Sum Problem
- A Partheno-Genetic Algorithm for Dynamic 0-1 Multidimensional Knapsack Problem
- CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- An exact algorithm for the budget-constrained multiple knapsack problem
- Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem
- A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem
- A Column-Generation Approach to the Multiple Knapsack Problem with Color Constraints
- Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction
- The Multidimensional Knapsack Problem: Structure and Algorithms
- A Dynamic Programming Heuristic for the Quadratic Knapsack Problem
- Approximation of the Quadratic Knapsack Problem
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
- Intelligent water drops algorithm
- Parameterized Approximation Scheme for the Multiple Knapsack Problem
- An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
- Exact Solution of the Quadratic Knapsack Problem
- A Lexicographic 0.5-Approximation Algorithm for the Multiple Knapsack Problem
- New reduction strategy in the biobjective knapsack problem
- Packing Groups of Items into Multiple Knapsacks
- Heuristic algorithms for the multiple-choice multidimensional knapsack problem
- 0-1 Quadratic Knapsack Problems: An Exact Approach Based on a $t$-Linearization
- Faster Approximation Schemes for the Two-Dimensional Knapsack Problem
- An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem
- The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
- A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem
- Multiple subset sum with inclusive assignment set restrictions
- Multicriteria Optimization
- A note on a two dimensional knapsack problem with unloading constraints
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- Lagrangian heuristics for the quadratic knapsack problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Online knapsack revisited
- The online knapsack problem with incremental capacity
- A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- A hybrid evolutionary algorithm for the two-dimensional packing problem
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
- On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
- An ejection chain approach for the quadratic multiple knapsack problem
- Asymptotic behavior of the quadratic knapsack problem
- Generalized quadratic multiple knapsack problem and two solution approaches
- Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm
- Models and algorithms for packing rectangles into the smallest square
- Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
- Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities
- A binary multiple knapsack model for single machine scheduling with machine unavailability
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
- 2D knapsack: packing squares
- Online removable knapsack with limited cuts
- An approximation scheme for the two-stage, two-dimensional knapsack problem
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
- The three-dimensional knapsack problem with balancing constraints
- A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems
- Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems
- Randomized algorithms for online knapsack problems
- Online unweighted knapsack problem with removal cost
- An adaptive population multi-objective quantum-inspired evolutionary algorithm for multi-objective 0/1 knapsack problems
- An effective GRASP and tabu search for the 0-1 quadratic knapsack problem
- Multicriteria 0-1 knapsack problems with \(k\)-min objectives
- Multiple criteria dynamic programming and multiple knapsack problem
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- A branch-and-bound algorithm for hard multiple knapsack problems
- A note on optimal solutions to quadratic knapsack problems
- A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) 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 exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
- Heuristic algorithms for the general nonlinear separable knapsack problem
- Computational experience with a core-based reduction procedure for the 2-knapsack problem
- A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem
- Hard multidimensional multiple choice knapsack problems, an empirical study
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- A randomized heuristic repair for the multidimensional knapsack problem
- A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
- Solving the linear multiple choice knapsack problem with two objectives: Profit and equity
- Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem
- Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
- On separating cover inequalities for the multidimensional knapsack problem
- Packing into the smallest square: worst-case analysis of lower bounds
- Model and algorithms for multi-period sea cargo mix problem
- The quadratic knapsack problem -- a survey
- Maximizing the total profit of rectangles packed into a rectangle
- Online minimization knapsack problem
- Scatter search for the 0-1 multidimensional knapsack problem
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- A column generation method for the multiple-choice multi-dimensional knapsack problem
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- An exact algorithm for the fixed-charge multiple knapsack problem
- A successive approximation algorithm for the multiple knapsack problem
- Approximation algorithms for orthogonal packing problems for hypercubes
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
- Heuristics for the 0-1 multidimensional knapsack problem
- A bound and bound algorithm for the zero-one multiple knapsack problem
- A genetic algorithm for the multidimensional knapsack problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- A 3/4-approximation algorithm for multiple subset sum
- The multidimensional 0-1 knapsack problem: an overview.
- A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints
- On the two-dimensional knapsack problem
- The nonlinear knapsack problem - algorithms and applications
- A PTAS for the multiple subset sum problem with different knapsack capacities
- An iterated ``hyperplane exploration approach for the quadratic knapsack problem
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
- Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems
- Relaxations and heuristics for the multiple non-linear separable knapsack problem
- Online knapsack with resource augmentation
- A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the Knapsack problem
- Approximation of the quadratic knapsack problem
- Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem
- Emergency relocation of items using single trips: special cases of the multiple knapsack assignment problem
- An application of the multiple knapsack problem: the self-sufficient marine
- An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
- Mathematical models and decomposition methods for the multiple knapsack problem
- A procedure-based heuristic for 0-1 multiple knapsack problems
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
- A computational study on the quadratic knapsack problem with multiple constraints
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
- Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
- Improved results on the 0--1 multidimensional knapsack problem
- Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints
- A new upper bound for the 0-1 quadratic knapsack problem
- A population heuristic for constrained two-dimensional non-guillotine cutting
