Search Results - subject:"Knapsack problem"

Approximating the product knapsack problem

Pferschy, Ulrich; Schauer, Joachim; Thielen, Clemens - In: Optimization Letters 15 (2021) 8, pp. 2529-2540

We consider the product knapsack problem, which is the variant of the classical 0-1 knapsack problem where the … negative. We present the first fully polynomial-time approximation scheme for the product knapsack problem, which is known to … knapsack greedy procedure to the product knapsack problem. …

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

A novel core-based optimization framework for binary integer programs- the multidemand multidimesional Knapsack problem as a test problem

Al-Shihabi, Sameh - In: Operations Research Perspectives 8 (2021), pp. 1-13

solve a set of 126 multidemand multidimensional knapsack problem (MDMKP) instances. We solve the resulting CPs using two …

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

On the exact separation of cover inequalities of maximum depth

Catanzaro, Daniele; Coniglio, Stefano; Furini, Fabio - 2021

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

Multi-objective evolutionary search strategies in constraint programming

Bennetto, Robert; Vuuren, Jan van - In: Operations research perspectives 8 (2021), pp. 1-15

It has been shown that evolutionary algorithms are able to construct suitable search strategies for classes of Constraint Satisfaction Problems (CSPs) in Constraint Programming. This paper is an explanation of the use of multi-objective optimisation in contrast to simple additive weighting...

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

The maximum diversity assortment selection problem

Prause, Felix; Hoppmann-Baum, Kai; Defourny, Boris; … - In: Mathematical methods of operations research : ZOR 93 (2021) 3, pp. 521-554

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

A novel core-based optimization framework for binary integer programs- the multidemand multidimesional Knapsack problem as a test problem

Al-Shihabi, Sameh - In: Operations research perspectives 8 (2021), pp. 1-13

solve a set of 126 multidemand multidimensional knapsack problem (MDMKP) instances. We solve the resulting CPs using two …

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

Competence-based assignment of tasks to workers in factories with demand-driven manufacturing

Staruch, Bożena; Staruch, Bogdan - In: Central European journal of operations research 29 (2021) 2, pp. 553-565

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

A branch-and-price algorithm for the Multiple Knapsack Problem

Lalonde, Olivier; Côté, Jean-François; Gendron, Bernard - 2021

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

Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems

Jooken, Jorik; Leyman, Pieter; Wauters, Tony; De … - In: Computers & operations research : and their … 150 (2023), pp. 1-25

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

The Knapsack Problem with forfeit sets

D'Ambrosio, Ciriaco; Laureana, Federica; Raiconi, Andrea; … - In: Computers & operations research : and their … 151 (2023), pp. 1-13

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