dc.contributor.author |
Chantzara, M |
en |
dc.contributor.author |
Anagnostou, M |
en |
dc.date.accessioned |
2014-03-01T02:44:07Z |
|
dc.date.available |
2014-03-01T02:44:07Z |
|
dc.date.issued |
2006 |
en |
dc.identifier.issn |
0302-9743 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/31686 |
|
dc.subject |
Heuristic Algorithm |
en |
dc.subject |
Optimal Solution |
en |
dc.subject |
Optimization Problem |
en |
dc.subject |
Knapsack Problem |
en |
dc.subject.classification |
Computer Science, Theory & Methods |
en |
dc.subject.other |
Algorithms |
en |
dc.subject.other |
Computer science |
en |
dc.subject.other |
Constraint theory |
en |
dc.subject.other |
Iterative methods |
en |
dc.subject.other |
Optimization |
en |
dc.subject.other |
Problem solving |
en |
dc.subject.other |
Knapsack problem |
en |
dc.subject.other |
Maximizing Value per Resources Consumption (MVRC) |
en |
dc.subject.other |
Multi-Choice Multi-Constraint Knapsack Problem |
en |
dc.subject.other |
Value per Aggregate Resources Consumption |
en |
dc.subject.other |
Heuristic methods |
en |
dc.title |
MVRC heuristic for solving the Multi-Choice Multi-Constraint Knapsack Problem |
en |
heal.type |
conferenceItem |
en |
heal.identifier.primary |
10.1007/11758501_78 |
en |
heal.identifier.secondary |
http://dx.doi.org/10.1007/11758501_78 |
en |
heal.language |
English |
en |
heal.publicationDate |
2006 |
en |
heal.abstract |
This paper presents the heuristic algorithm Maximizing Value per Resources Consumption (MVRC) that solves the Multi-Choice MultiConstraint Knapsack Problem, a variant of the known NP-hard optimization problem called Knapsack problem. Starting with an initial solution, the MVRC performs iterative improvements through exchanging the already picked items in order to conclude to the optimal solution. Following a three step procedure, it tries to pick the items with the maximum Value per Aggregate Resources Consumption. The proposed algorithm has been evaluated in terms of the quality of the final solution and its run-time performance. © Springer-Verlag Berlin Heidelberg 2006. |
en |
heal.publisher |
SPRINGER-VERLAG BERLIN |
en |
heal.journalName |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
en |
heal.bookName |
LECTURE NOTES IN COMPUTER SCIENCE |
en |
dc.identifier.doi |
10.1007/11758501_78 |
en |
dc.identifier.isi |
ISI:000238389200074 |
en |
dc.identifier.volume |
3991 LNCS - I |
en |
dc.identifier.spage |
579 |
en |
dc.identifier.epage |
587 |
en |