Showing 1 - 10 of 12,367
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/10011558832
A budget-constrained buyer wants to purchase items from a shortlisted set. Items are differentiated by quality and sellers have private reserve prices for their items. Sellers quote prices strategically, inducing a knapsack game. The buyer's problem is to select a subset of maximal quality. We...
Persistent link: https://www.econbiz.de/10010271568
A budget-constrained buyer wants to purchase items from a shortlisted set. Items are differentiated by quality and sellers have private reserve prices for their items. Sellers quote prices strategically, inducing a knapsack game. The buyer's problem is to select a subset of maximal quality. We...
Persistent link: https://www.econbiz.de/10010333849
A budget-constrained buyer wants to purchase items from a short-listed set. Items are differentiated by observable quality and sellers have private reserve prices for their items. The buyer's problem is to select a subset of maximal quality. Money does not enter the buyer's objective function,...
Persistent link: https://www.econbiz.de/10010334028
A budget-constrained buyer wants to purchase items from a shortlisted set. Items are differentiated by observable quality and sellers have private reserve prices for their items. The buyer's problem is to select a subset of maximal quality. Money does not enter the buyer's objective function,...
Persistent link: https://www.econbiz.de/10010282909
will present a general mathematical programming algorithm which can be applied to find an element in the interval core. As …
Persistent link: https://www.econbiz.de/10010421344
compared with results obtained by using an alternative objective funetion based on Mahalanobis distance. The algorithm and the …
Persistent link: https://www.econbiz.de/10010397976
degree of complexity, which means that there is probably no exact optimization algorithm that works in economic Computing … such an algorithm is the Threshold Accepting Algorithm (TA). We implement TA for the optimal aggregation of price indices …. The algorithm and the resulting groupings are presented. The results show that the use of Standard or "official" modes of …
Persistent link: https://www.econbiz.de/10010398200
The Capacitated Facility Location Problem (CFLP) is a well-known combinatorial optimization problem with applications in distribution and production planning. A variety of lower bounds based on Lagrangean relaxation and subgradient optimization has been proposed for this problem. However, in...
Persistent link: https://www.econbiz.de/10011558775
In 1997 two papers_new applying the metaheuristics Tabu Search (TS) and Heuristic Concentration (HC) tothe p-median problem were published in consecutive volumes of the European Journal of OperationalResearch. Here we apply the method of HC some of the data sets which were used for...
Persistent link: https://www.econbiz.de/10010324381