Showing 1 - 10 of 33
The 0-1 knapsack problem with a single continuous variable (KPC) is a natural extension of the binary knapsack problem (KP), where the capacity is not any longer fixed but can be extended which is expressed by a continuous variable. This variable might be unbounded or restricted by a lower or...
Persistent link: https://www.econbiz.de/10011723112
. In this paper we propose a family of linear programming models the optimal solution of which is integral for many …
Persistent link: https://www.econbiz.de/10011723148
setting is that the winner determination problem is a hard integer programming problem and hence a linear pricing scheme … supporting the optimal allocation might not exist. From integer programming duality theory we know that there exist non …
Persistent link: https://www.econbiz.de/10011723165
programming models are the means to formally define what the particular problem under consideration is all about. Moreover, the …
Persistent link: https://www.econbiz.de/10011723710
, integer programming models are introduced. We pick up a popular idea and decompose the overall problem in order to obtain two …
Persistent link: https://www.econbiz.de/10011723806
setting is that the winner determination problem is a hard integer programming problem and hence in general there does not … optimal allocation can in general not be found. In this article we present an alternative. From integer programming duality … computationally a heuristic can be used which essentially requires us to solve a sequence of linear programming relaxations of a new …
Persistent link: https://www.econbiz.de/10011724100
the work force is either given or can be obtained without difficulty. In this research we provide an integer programming …
Persistent link: https://www.econbiz.de/10011724267
Persistent link: https://www.econbiz.de/10011325644
Persistent link: https://www.econbiz.de/10001628107
Persistent link: https://www.econbiz.de/10001628184