A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
From MaRDI portal
Publication:5888079
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
Cited in
(23)- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
- The recommender problem with convex hulls
- Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem
- The constrained compartmentalised knapsack problem
- Exact approaches for the knapsack problem with setups
- Knapsack problems with dependencies through non-additive measures and Choquet integral
- The multiple multidimensional knapsack with family-split penalties
- Towards the real time solution of strike force asset allocation problems
- A hybrid genetic algorithm for constrained combinatorial problems: an application to promotion planning problems
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
- 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
- Pricing combinatorial auctions.
- Benchmarking non-first-come-first-served component allocation in an assemble-to-order system
- 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)
