Similar Search Results

A reduction dynamic programming algorithm for the bi-objective integer knapsack problem

Rong, Aiying; Figueira, José Rui - In: European journal of operational research : EJOR 231 (2013) 2, pp. 299-313

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

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

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

Bi-dimensional knapsack problems with one soft constraint

Schulze, Britta; Paquete, Luís F.; Klamroth, Kathrin; … - In: Computers & operations research : and their … 78 (2017), pp. 15-26

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

The binary knapsack problem with qualitative levels

Schäfer, Luca E.; Dietz, Tobias; Barbati, Maria; … - In: European journal of operational research : EJOR 289 (2021) 2, pp. 508-514

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

Divide-and-conquer initialization and mutation operators for the large-scale mixed Capacitated Arc Routing Problem

Oliveira, Diogo F.; Martins, Miguel S. E.; Sousa, João … - In: European journal of operational research : EJOR 321 (2025) 2, pp. 383-396

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