Ma Y, Wan J (2011) Improved hybrid adaptive genetic algorithm for solving knapsack problem. Lim TY, Al-Betar MA, Khader AT (2016) Taming the 0/1 knapsack problem with monogamous pairs genetic algorithm. In: Advanced materials research, vol 143. Gong QQ, Zhou YQ, Yang Y (2011) Artificial glowworm swarm optimization algorithm for solving 0–1 knapsack problem. Osaba E, Yang XS, Diaz F, Lopez-Garcia P, Carballedo R (2016) An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems. In: Paradigms of combinatorial optimization, 2nd edn, pp 215–242 Plateau G, Nagih A (2010) 0–1 knapsack problems. Martello S, Pisinger D, Toth P (2000) New trends in exact algorithms for the 0–1 knapsack problem. Johnson EL, Mehrotra A, Nemhauser GL (1993) Min-cut clustering. INFORMS J Comput 15(3):284–309įerreira CE, Martin A, de Souza CC, Weismantel R, Wolsey LA (1996) Formulations and valid inequalities for the node capacitated graph partitioning problem. Oper Res 14(6):1045–1074ĭe Vries S, Vohra RV (2003) Combinatorial auctions: a survey. Gilmore PC, Gomory RE (1966) The theory and computation of knapsack functions. Mansini R, Speranza MG (1999) Heuristic algorithms for the portfolio selection problem with minimum transaction lots. Weingartner HM (1966) Capital budgeting of interrelated projects: survey and synthesis.
In: Linear and integer programming made easy. Hu TC, Kahng AB (2016) The knapsack problem.
0 kommentar(er)
