A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
From MaRDI portal
Publication:5888079
DOI10.1080/03155986.1998.11732364OpenAlexW2395527326MaRDI QIDQ5888079
Publication date: 21 April 2023
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03155986.1998.11732364
Related Items (22)
Knapsack problems with dependencies through non-additive measures and Choquet integral ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Maximizing revenue of end of life items in retail stores ⋮ Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions ⋮ An exact approach for the 0-1 knapsack problem with setups ⋮ Exact approaches for the knapsack problem with setups ⋮ Order splitting with multiple capacitated suppliers ⋮ The constrained compartmentalised knapsack problem ⋮ Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem ⋮ LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup ⋮ Pricing combinatorial auctions. ⋮ Exact and heuristic solution approaches for the mixed integer setup knapsack problem ⋮ A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints ⋮ Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem ⋮ \(L\)-class enumeration algorithms for a discrete production planning problem with interval resource quantities ⋮ A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) ⋮ Benchmarking non-first-come-first-served component allocation in an assemble-to-order system ⋮ Towards the real time solution of strike force asset allocation problems ⋮ Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search ⋮ The multiple multidimensional knapsack with family-split penalties ⋮ A Hybrid Genetic Algorithm for Constrained Combinatorial Problems: An Application to Promotion Planning Problems
This page was built for publication: A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
