Similar Search Results

Modifizierte Schrittsteinmethode zur ganzzahligen simultanen Produktionsprogramm-, Transport- und Absatzmengenplanun

Lerm, Michael; Rollberg, Roland - 2007

Persistent link: https://www.econbiz.de/10010300263

Subsidies, Knapsack Auctions and Dantzig's Greedy Heuristic

Ensthaler, Ludwig; Giebe, Thomas - 2009

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

How to allocate Research (and other) Subsidies

Ensthaler, Ludwig; Giebe, Thomas - 2011

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 boolean satisfiability approach to the resource-constrained project scheduling problem

Horbach, Andrei - 2009

We formulate the resource-constrained project scheduling problem as a satisfiabil-ity problem and adapt a satisfiability solver for the specific domain of the problem. Our solver is lightweight and shows good performance both in finding feasible solutions and in proving lower bounds. Our...

Persistent link: https://www.econbiz.de/10011558715

Combinatorial optimisation problems of the assignment type and a partitioning approach

Klose, Andreas; Drexl, Andreas - 2001

Assignment type problems consist in optimally assigning or allocating a given set of "activities" to a given set of "resources". Optimisation problems of the assignment type have numerous applications in production planning and logistics. A popular approach to solve such problems or to compute...

Persistent link: https://www.econbiz.de/10011558776

Work force planning in the printing industry

Mundschenk, Martin; Drexl, Andreas - 2005

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/10011558804

Non-linear anonymous pricing in combinatorial auctions

Drexl, Andreas; Jørnsten, Kurt; Knof, Diether - 2005

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/10011558809

Round robin tournaments and three index assignment

Briskorn, Dirk; Drexl, Andreas; Spieksma, Frits C. R. - 2005

, 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/10011558814

Integer programming models for round robin tournaments

Briskorn, Dirk; Drexl, Andreas - 2006

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/10011558821

Non-linear anonymous pricing combinatorial auctions

Drexl, Andreas; Jørnsten, Kurt; Knof, Diether - 2007

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/10011558831