Application of GRASP to the multiconstraint knapsack problem

Research output: Chapter in Book/Report/Conference proceedingChapter

6 Citations (Scopus)

Abstract

A number of approaches based on GRASP are presented for the Multiconstraint Knapsack Problem. GRASP combines greedy construction of feasible solutions with local search. Results from applying our algorithms to standard test problems are presented and compared with results obtained by Chu and Beasley.
Original languageEnglish
Title of host publicationApplications of Evolutionary Computing
EditorsEgbert J. W. Boers
PublisherSpringer
Pages30-39
Number of pages10
Volume2037
ISBN (Print)978-3-540-41920-4
DOIs
Publication statusPublished - 2001

Publication series

NameLecture Notes in Computer Science
PublisherSpringer-Verlag

Cite this