Application of GRASP to the multiconstraint knapsack problem

DOI10.1007/3-540-45365-2_4MaRDI QIDQ2770483zbMATH OpenFDO

Authors Pierre Chardaire, G. P. McKeown, Jameel A. Maki

Publication date 13 February 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2037/20370030

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms
• A heuristic solution procedure for the multiconstraint zero-one knapsack problem
• A grasp-knapsack hybrid for a nurse-scheduling problem
• scientific article; zbMATH DE number 2050708
• A class of generalized greedy algorithms for the multi-knapsack problem

Cited in

(2)

• An annotated bibliography of GRASP-Part II: Applications
• A grasp-knapsack hybrid for a nurse-scheduling problem

This page was built for publication: Application of GRASP to the multiconstraint knapsack problem

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