The Inverse Bin-Packing Problem Subject to Qualitative Criteria

A new formulation of the reverse bin-packing problem is suggested. One distinct feature of the new formulation is that it takes into account of a decision-maker’s preferences for a set of objects that are evaluated by multiple quality criteria. The aspects of this problem are discussed that relate t...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Scientific and technical information processing Ročník 44; číslo 6; s. 440 - 449
Hlavní autor: Furems, E. M.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Moscow Pleiades Publishing 01.12.2017
Springer Nature B.V
Témata:
Computer Science
Computer Systems Organization and Communication Networks
Criteria
Decision making
Decision theory
Knapsack problem
Multiple criteria decision making
Multiple criterion
Preferences
Qualitative research
inverse bin-packing problem
branch and bound method
genetic algorithms
ordinal classification
approximate algorithm
preference relation
ISSN:0147-6882, 1934-8118
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A new formulation of the reverse bin-packing problem is suggested. One distinct feature of the new formulation is that it takes into account of a decision-maker’s preferences for a set of objects that are evaluated by multiple quality criteria. The aspects of this problem are discussed that relate to the theory of multiple criteria decision making. The known methods for solving the classic and the reverse bin-packing problems (the multiple knapsack problem) are reviewed.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0147-6882
1934-8118
DOI:10.3103/S0147688217060065