A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems

DOI10.1080/03155986.1998.11732364OpenAlexW2395527326MaRDI QIDQ5888079FDOQ5888079

Authors: Edward Yu-Hsien Lin 

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

Recommendations

• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• The multidimensional 0-1 knapsack problem: an overview.
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• Publication:3471851

zbMATH Keywords

optimizationcombinatoricsinteger programmingknapsack problems

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cited In (23)

• The recommender problem with convex hulls
• Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
• Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem
• Exact approaches for the knapsack problem with setups
• The constrained compartmentalised knapsack problem
• Knapsack problems with dependencies through non-additive measures and Choquet integral
• A hybrid genetic algorithm for constrained combinatorial problems: an application to promotion planning problems
• The multiple multidimensional knapsack with family-split penalties
• Towards the real time solution of strike force asset allocation problems
• LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem
• Maximizing revenue of end of life items in retail stores
• Order splitting with multiple capacitated suppliers
• Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• Benchmarking non-first-come-first-served component allocation in an assemble-to-order system
• 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
• \(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)
• An exact approach for the 0-1 knapsack problem with setups

This page was built for publication: A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems

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