Pages that link to "Item:Q5888079"
From MaRDI portal
The following pages link to A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems (Q5888079):
Displaying 22 items.
- Maximizing revenue of end of life items in retail stores (Q323500) (← links)
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search (Q706997) (← links)
- Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions (Q852959) (← links)
- Order splitting with multiple capacitated suppliers (Q859919) (← links)
- The constrained compartmentalised knapsack problem (Q868151) (← links)
- Exact and heuristic solution approaches for the mixed integer setup knapsack problem (Q928018) (← links)
- \(L\)-class enumeration algorithms for a discrete production planning problem with interval resource quantities (Q954026) (← links)
- Pricing combinatorial auctions. (Q1420433) (← links)
- A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints (Q1433165) (← links)
- An exact approach for the 0-1 knapsack problem with setups (Q1652189) (← links)
- Exact approaches for the knapsack problem with setups (Q1652523) (← links)
- Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem (Q1730435) (← links)
- A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) (Q1761954) (← links)
- Towards the real time solution of strike force asset allocation problems (Q1765539) (← links)
- The multiple multidimensional knapsack with family-split penalties (Q2029273) (← links)
- Knapsack problems with dependencies through non-additive measures and Choquet integral (Q2140163) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem (Q2185833) (← links)
- Benchmarking non-first-come-first-served component allocation in an assemble-to-order system (Q2259032) (← links)
- A Hybrid Genetic Algorithm for Constrained Combinatorial Problems: An Application to Promotion Planning Problems (Q5232832) (← links)
- LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup (Q6146649) (← links)