Search Results - subject:"knapsack problem"

Subsidies, knapsack auctions and Dantzig's greedy heuristic

Ensthaler, Ludwig; Giebe, Thomas - 2009

extension of Dantzig's greedy heuristic for the classic knapsack problem. We use Monte Carlo simulations to analyse the …

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

Subsidies, Knapsack Auctions and Dantzig's Greedy Heuristic

Ensthaler, Ludwig; Giebe, Thomas - 2009

extension of Dantzig's greedy heuristic for the classic knapsack problem. We use Monte Carlo simulations to analyse the …

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

An index for dynamic product promotion and the knapsack problem for perishable items

Jacko, Peter; Nino-MOra, Jose - Departamento de Estadistica, Universidad Carlos III de … - 2009

This paper introduces the knapsack problem for perishable items (KPPI), which concerns the optimal dynamic allocation …

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

Subsidies, Knapsack Auctions and Dantzig's Greedy Heuristic

Ensthaler, Ludwig; Giebe, Thomas - DIW Berlin (Deutsches Institut für Wirtschaftsforschung) - 2009

extension of Dantzig's greedy heuristic for the classic knapsack problem. We use Monte Carlo simulations to analyse the …

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

Subsidies, Knapsack Auctions and Dantzigâ€™s Greedy Heuristic

Ensthaler, Ludwig; Giebe, Thomas - Volkswirtschaftliche Fakultät, … - 2009

extension of Dantzigâ€™s greedy heuristic for the classic knapsack problem. We use Monte Carlo simulations to analyse the …

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

Subsidies, knapsack auctions and Dantzig’s greedy heuristic

Ensthaler, Ludwig; Giebe, Thomas - 2009

extension of Dantzig's greedy heuristic for the classic knapsack problem. We use Monte Carlo simulations to analyse the …’s greedy heuristic for the classic knapsack problem. We use Monte Carlo simulations to analyse the performance of our mechanism …: Auctions, Subsidies, Market Design, Knapsack Problem 1. introduction …

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

A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances

Reilly, Charles H.; Sapkota, Nabin - In: European Journal of Operational Research 241 (2015) 3, pp. 642-652

We consider a family of composite bivariate distributions, or probability mass functions (pmfs), with uniform marginals for simulating optimization-problem instances. For every possible population correlation, except the extreme values, there are an infinite number of valid joint distributions...

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

Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems

Cerqueus, Audrey; Przybylski, Anthony; Gandibleux, Xavier - In: European Journal of Operational Research 244 (2015) 2, pp. 417-433

-dimensional binary knapsack problem. It introduces the Optimal Convex Surrogate Upper Bound set, which is the tightest possible …

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

An exact algorithm for the reliability redundancy allocation problem

Caserta, Marco; Voß, Stefan - In: European Journal of Operational Research 244 (2015) 1, pp. 110-116

choice knapsack problem and solved to optimality via a branch and cut algorithm. The algorithm is tested on well-known sets …

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

A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances

Reilly, Charles H.; Sapkota, Nabin - In: European journal of operational research : EJOR 241 (2015) 3, pp. 642-652

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