Search Results - subject:"Knapsack problems"

Did you mean: subject:"Knapsack problem" (306 results)

On lifted cover inequalities : a new lifting procedure with unusual properties

Letchford, Adam N.; Souli, Georgia - In: Operations research letters 47 (2019) 2, pp. 83-87

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

The robust multiple-choice multidimensional knapsack problem

Caserta, Marco; Voß, Stefan - In: Omega : the international journal of management science 86 (2019), pp. 16-27

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

Approximations to stochastic dynamic programs via information relaxation duality

Balseiro, Santiago R.; Brown, David B. - In: Operations research 67 (2019) 2, pp. 577-597

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

Exact approaches for the knapsack problem with setups

Furini, Fabio; Monaci, Michele; Traversi, Emiliano - In: Computers & operations research : and their … 90 (2018), pp. 208-220

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

An FPTAS for the knapsack problem with parametric weights

Halman, Nir; Holzhauser, Michael; Krumke, Sven O. - In: Operations research letters 46 (2018) 5, pp. 487-491

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

Recursive circle packing problems

Pedroso, João Pedro; Cunha, Sílvia; Tavares, João Nuno - In: International transactions in operational research : … 23 (2016) 1/2, pp. 355-368

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

The online knapsack problem with incremental capacity

Thielen, Clemens; Tiedemann, Morten; Westphal, Stephan - In: Mathematical methods of operations research 83 (2016) 2, pp. 207-242

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

Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm

Kong, Xiangyong; Gao, Liqun; Ouyang, Haibin; Li, Steve - In: Computers & operations research : and their … 63 (2015), pp. 7-22

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

Dynamic programming algorithms for the bi-objective integer knapsack problem

Rong, Aiying; Figueira, José Rui - In: European Journal of Operational Research 236 (2014) 1, pp. 85-99

This paper presents two new dynamic programming (DP) algorithms to find the exact Pareto frontier for the bi-objective integer knapsack problem. First, a property of the traditional DP algorithm for the multi-objective integer knapsack problem is identified. The first algorithm is developed by...

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

Dynamic programming algorithms for the bi-objective integer knapsack problem

Rong, Aiying; Figueira, José Rui - In: European journal of operational research : EJOR 236 (2014) 1, pp. 85-99

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