Showing 1 - 8 of 8
Persistent link: https://www.econbiz.de/10003611374
Persistent link: https://www.econbiz.de/10003611380
Persistent link: https://www.econbiz.de/10003611386
Persistent link: https://www.econbiz.de/10003070793
The generalized assignment problem (GAP) examines the maximum profit assignment of jobs to processors such that each job is assigned to precisely one processor subject to capacity restrictions on the processors. Due to the fact that the GAP is an NP-hard integer program dual prices are not...
Persistent link: https://www.econbiz.de/10011723131
The multiple-choice nested knapsack problem (MCKP) is a generalization of the ordinary knapsack problem, where the set of items is partitioned into classes. The binary choice of selecting an item is replaced by taking exactly one item out of each class of items. Due to the fact that the MCKP is...
Persistent link: https://www.econbiz.de/10011723148
In combinatorial auctions the pricing problem is of main concern since it is the means by which the auctioneer signals the result of the auction to the participants. In order for the auction to be regarded as fair among the various participants the price signals should be such that a participant...
Persistent link: https://www.econbiz.de/10011723165
In combinatorial auctions the pricing problem is of main concern since it is the means by which the auctioneer signals the result of the auction to the participants. In order for the auction to be regarded as fair among the various participants the price signals should be such that a participant...
Persistent link: https://www.econbiz.de/10011724100