dc.contributor.author |
Fleszar K. |
dc.contributor.author |
Hindi K.S. |
dc.contributor.editor |
|
dc.date |
2009 |
dc.date.accessioned |
2017-09-07T07:51:44Z |
dc.date.available |
2017-09-07T07:51:44Z |
dc.date.issued |
2009 |
dc.identifier |
10.1016/j.cor.2008.03.003 |
dc.identifier.isbn |
|
dc.identifier.issn |
03050548 |
dc.identifier.uri |
http://hdl.handle.net/10938/12320 |
dc.description.abstract |
The objective of the multi-dimensional knapsack problem (MKP) is to find a subset of items with maximum value that satisfies a number of knapsack constraints. Solution methods for MKP, both heuristic and exact, have been researched for several decades. This paper introduces several fast and effective heuristics for MKP that are based on solving the LP relaxation of the problem. Improving procedures are proposed to strengthen the results of these heuristics. Additionally, the heuristics are run with appropriate deterministic or randomly generated constraints imposed on the linear relaxation that allow generating a number of good solutions. All algorithms are tested experimentally on a widely used set of benchmark problem instances to show that they compare favourably with the best-performing heuristics available in the literature. © 2008 Elsevier Ltd. All rights reserved. |
dc.format.extent |
|
dc.format.extent |
Pages: (1602-1607) |
dc.language |
English |
dc.publisher |
OXFORD |
dc.relation.ispartof |
Publication Name: Computers and Operations Research; Publication Year: 2009; Volume: 36; no. 5; Pages: (1602-1607); |
dc.relation.ispartofseries |
|
dc.relation.uri |
|
dc.source |
Scopus |
dc.subject.other |
|
dc.title |
Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem |
dc.type |
Article |
dc.contributor.affiliation |
Fleszar, K., Olayan School of Business, American University of Beirut (AUB), P.O. Box 11-0236, Riad El Solh, Beirut 1107 2020, Lebanon |
dc.contributor.affiliation |
Hindi, K.S., Olayan School of Business, American University of Beirut (AUB), P.O. Box 11-0236, Riad El Solh, Beirut 1107 2020, Lebanon |
dc.contributor.authorAddress |
Fleszar, K.; Olayan School of Business, American University of Beirut (AUB), P.O. Box 11-0236, Riad El Solh, Beirut 1107 2020, Lebanon; email: Krzysztof.Fleszar@aub.edu.lb |
dc.contributor.authorCorporate |
University: American University of Beirut; Faculty: Suliman S. Olayan School of Business; Department: School of Business; |
dc.contributor.authorDepartment |
School of Business |
dc.contributor.authorDivision |
|
dc.contributor.authorEmail |
Krzysztof.Fleszar@aub.edu.lb; Khalil.Hindi@aub.edu.lb |
dc.contributor.faculty |
Suliman S. Olayan School of Business |
dc.contributor.authorInitials |
Fleszar, K |
dc.contributor.authorInitials |
Hindi, KS |
dc.contributor.authorOrcidID |
Fleszar, Krzysztof-0000-0001-8863-6756 |
dc.contributor.authorReprintAddress |
Fleszar, K (reprint author), Amer Univ Beirut, Olayan Sch Business, POB 11-0236, Beirut 11072020, Lebanon. |
dc.contributor.authorResearcherID |
Fleszar, Krzysztof-B-8260-2012 |
dc.contributor.authorUniversity |
American University of Beirut |
dc.description.cited |
Akcay Y, 2007, ANN OPER RES, V150, P17, DOI 10.1007-s10479-006-0150-4; Bertsimas D, 2002, MANAGE SCI, V48, P550, DOI 10.1287-mnsc.48.4.550.208; Chu PC, 1998, J HEURISTICS, V4, P63, DOI 10.1023-A:1009642405419; DEVRIES S, 2000, COMBINATORIAL AUCTIO; Ferreira C. E., 1993, ZOR, Methods and Models of Operations Research, V38, DOI 10.1007-BF01416008; Freville A, 2005, ANN OPER RES, V139, P195, DOI 10.1007-s10479-005-3448-8; Freville A, 2004, EUR J OPER RES, V155, P1, DOI 10.1016-S0377-2217(03)00274-1; FREVILLE A, 1994, DISCRETE APPL MATH, V49, P189, DOI 10.1016-0166-218X(94)90209-7; GAVISH B, 1985, MATH PROGRAM, V31, P78, DOI 10.1007-BF02591863; GILMORE PC, 1966, OPER RES, V14, P1045, DOI 10.1287-opre.14.6.1045; Hanafi S, 2007, EUR J OPER RES, V179, P50, DOI 10.1016-j.ejor.2006.03.046; Kochenberger G., 1974, DECISION SCI, V5, P36, DOI 10.1111-j.1540-5915.1974.tb00593.x; LOULOU R, 1979, OPER RES, V27, P1101, DOI 10.1287-opre.27.6.1101; MAGAZINE MJ, 1984, EUR J OPER RES, V16, P319, DOI 10.1016-0377-2217(84)90286-8; Osorio MA, 2002, ANN OPER RES, V117, P71, DOI 10.1023-A:1021513321301; Petersen C., 1967, MANAGE SCI, V13, P736, DOI 10.1287-mnsc.13.9.736; PIRKUL H, 1987, NAV RES LOG, V34, P161, DOI 10.1002-1520-6750(198704)34:2161::AID-NAV32203402033.0.CO;2-A; ROTHKOPF MH, 1995, 9509 RUTG U; Senju S., 1968, MANAGE SCI, V15, P196, DOI 10.1287-mnsc.15.4.B196; TOYODA Y, 1975, MANAGE SCI B-APPL, V21, P1417, DOI 10.1287-mnsc.21.12.1417; Vasquez M, 2005, EUR J OPER RES, V165, P70, DOI 10.1016-j.ejor.2004.01.024; VASQUEZ M, 2001, INT JOINT C ART INT, P328; VOLGENANT A, 1990, J OPER RES SOC, V41, P963, DOI 10.1057-jors.1990.148; Volgenant A, 2007, J OPER RES SOC, V58, P73, DOI 10.1057-palgrave.jors.2602102 |
dc.description.citedCount |
14 |
dc.description.citedTotWOSCount |
11 |
dc.description.citedWOSCount |
10 |
dc.format.extentCount |
6 |
dc.identifier.articleNo |
|
dc.identifier.coden |
CMORA |
dc.identifier.pubmedID |
|
dc.identifier.scopusID |
55749107142 |
dc.identifier.url |
|
dc.publisher.address |
THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLAND |
dc.relation.ispartofConference |
|
dc.relation.ispartofConferenceCode |
|
dc.relation.ispartofConferenceDate |
|
dc.relation.ispartofConferenceHosting |
|
dc.relation.ispartofConferenceLoc |
|
dc.relation.ispartofConferenceSponsor |
|
dc.relation.ispartofConferenceTitle |
|
dc.relation.ispartofFundingAgency |
|
dc.relation.ispartOfISOAbbr |
Comput. Oper. Res. |
dc.relation.ispartOfIssue |
5 |
dc.relation.ispartOfPart |
|
dc.relation.ispartofPubTitle |
Computers and Operations Research |
dc.relation.ispartofPubTitleAbbr |
Comp. Oper. Res. |
dc.relation.ispartOfSpecialIssue |
|
dc.relation.ispartOfSuppl |
|
dc.relation.ispartOfVolume |
36 |
dc.source.ID |
WOS:000262882500019 |
dc.type.publication |
Journal |
dc.subject.otherAuthKeyword |
Heuristics |
dc.subject.otherAuthKeyword |
LP relaxation |
dc.subject.otherAuthKeyword |
Multi-dimensional knapsack problem |
dc.subject.otherChemCAS |
|
dc.subject.otherIndex |
Carbon fiber reinforced plastics |
dc.subject.otherIndex |
Integer programming |
dc.subject.otherIndex |
Solutions |
dc.subject.otherIndex |
Benchmark problems |
dc.subject.otherIndex |
Heuristics |
dc.subject.otherIndex |
Knapsack constraints |
dc.subject.otherIndex |
Knapsack problems |
dc.subject.otherIndex |
Linear relaxations |
dc.subject.otherIndex |
LP relaxation |
dc.subject.otherIndex |
Lp relaxations |
dc.subject.otherIndex |
Maximum values |
dc.subject.otherIndex |
Multi-dimensional |
dc.subject.otherIndex |
Multi-dimensional knapsack problem |
dc.subject.otherIndex |
Solution methods |
dc.subject.otherIndex |
Heuristic methods |
dc.subject.otherKeywordPlus |
ALGORITHM |
dc.subject.otherWOS |
Computer Science, Interdisciplinary Applications |
dc.subject.otherWOS |
Engineering, Industrial |
dc.subject.otherWOS |
Operations Research and Management Science |
dc.identifier.doi |
https://doi.org/10.1016/j.cor.2008.03.003 |