References
- AkbarMMRahmanMSKaykobadMManningEGShojaGCSolving the multidimensional multiple-choice knapsack problem by constructing convex hullsComputers & Operations Research20063351259127310.1016/j.cor.2004.09.016
- BattitiRTecchiolliGThe reactive tabu searchORSA Journal on Computing19946212614010.1287/ijoc.6.2.126
- BertsimasDDemirRAn approximate dynamic programming approach to multidimensional knapsack problemsManagement Science200248455056510.1287/mnsc.48.4.550.208
- FaalandBHThe multiperiod knapsack problemOperations Research198129361261610.1287/opre.29.3.612
- DudzinskiKWalukiewiczSOn the multiperiod binary knapsack problemMethods of Operations Research198549223232
- DueckGScheuerTThreshold accepting. A general purpose optimization algorithm superior to simulated annealingJournal of Computational Physics199090116117510.1016/0021-9991(90)90201-B
- FlorianMLenstraJKRinnooy KanAHGDeterministic production planning: Algorithms and complexityManagement Science198026766967910.1287/mnsc.26.7.669
- GareyMRJohnsonDSComputers and Intractability: A Guide to the Theory of NP-Completeness1979
- GensGVLevnerEFast approximation algorithm for job sequencing with deadlinesDiscrete Applied Mathematics19813431331810.1016/0166-218X(81)90008-1
- GloverFTabu search—Part IORSA Journal on Computing19891319020610.1287/ijoc.1.3.190
- HifiMMichrafyMSbihiAHeuristic algorithms for the multiple-choice multidimensional knapsack problemJournal of Operational Research Society200455121323133210.1057/palgrave.jors.2601796
- HifiMMichrafyMSbihiAA reactive local search-based algorithm for the multiple-choice multidimensional knapsack problemComputational Optimization and Applications2006332–327128510.1007/s10589-005-3057-0
- Hiremath CS (2004). New heuristic and metaheuristic approaches applied to the multiple-choice multiple dimensional knapsack problem. PhD Thesis, Wright State University.
- HiremathCSHillRNew greedy heuristics for the multiple-choice multi-dimensional knapsack problemInternational Journal of Operational Research20072449551210.1504/IJOR.2007.014176
- KhanSLiKFManningEGAkbarMMSolving the knapsack problem for adaptive multimedia systemsStudia Informatica Universalis200321157178
- KellererHPferschyUPisingerDKnapsack Problems2004
- Kirshner S (2011). Optimizing an NBA team's approach to free agency using a multiple-choice knapsack model. MIT Sloan Sports Analytics Conference.
- LinEYHChenMCA dynamic programming approach to the multiple-choice multi-period knapsack problem and the recursive APL2 codeJournal of Information & Optimization Sciences201031228930310.1080/02522667.2010.10699960
- LinEYHWuCMThe multiple-choice multi-period knapsack problemJournal of the Operational Research Society200455218719710.1057/palgrave.jors.2601661
- MartelloSPisingerDTothPDynamic programming and strong bounds for the 0–1 knapsack problemManagement Science199945341442410.1287/mnsc.45.3.414
- MoserMJokanovićDPShiratoriNAn algorithm for the multidimensional multiple-choice knapsack problemIEECE Transactions on Fundamentals of Electronics1997803582589
- NaussMRThe 0-1 knapsack problem with multiple-choice constraintsEuropean Journal of Operational Research19782212513110.1016/0377-2217(78)90108-X
- PuchingerJRaidlGPferschyUThe core concept for the multi-dimensional knapsack problemEvolutionary Computation in Combinatorial Optimization—EvoCOP 20062006195208
- ResendeMGCRibeiroCCGRASP with path-relinking: Recent advances and applicationsMetaheuristics: Progress as Real Problem Solvers 200520052963
- SavageSWeinerPBagchiANeighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficientJournal of Computer and System Sciences1976121253510.1016/S0022-0000(76)80016-5
- SbihiAA best first search exact algorithm for the multiple-choice multidimensional knapsack problemJournal of Combinatorial Optimization200713433735110.1007/s10878-006-9035-3
- ToyodaYA simplified algorithm for obtaining approximate solutions to zero-one programming problemsManagement Science197521121417142710.1287/mnsc.21.12.1417
- VoudourisCTsangEPKGuided local search and its application to the traveling salesman problemEuropean Journal of Operational Research1999113246949910.1016/S0377-2217(98)00099-X
- YoonYKimYHMoonBRA theoretical and empirical investigation on the Lagrangian capacities of the 0-1 multidimensional knapsack problemEuropean Journal of Operational Research2012218236637610.1016/j.ejor.2011.11.011