Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Marked Items 
Alerts
Order History
Saved Items
All
Favorites
    
Book Chapter Printable view
Application of GRASP to the Multiconstraint Knapsack Problem⋆

Application of GRASP to the Multiconstraint Knapsack Problem⋆

Book SeriesLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
ISSN0302-9743 (Print) 1611-3349 (Online)
VolumeVolume 2037/2001
BookApplications of Evolutionary Computing
DOI10.1007/3-540-45365-2
Copyright2001
ISBN978-3-540-41920-4
DOI10.1007/3-540-45365-2_4
Pages30-39
Subject CollectionComputer Science
SpringerLink DateMonday, January 01, 2001
Add to marked items

Application of GRASP to the Multiconstraint Knapsack Problem⋆

Pierre Chardaire, Geoff P. McKeown Contact Information and Jameel A. Maki5

(5)  UEA Norwich, NR4 7TJ
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.

Contact Information Geoff P. McKeown
Email: gpm@sys.uea.ac.uk
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.
more options
Find


Export this chapter
Export this chapter as RIS | Text
 
Frequently asked questions | General information on journals and books | Send us your feedback | Impressum | Contact
© Springer. Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
Remote Address: 38.107.191.106 • Server: mpweb01
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)