Dynamic programming algorithms for the bi-objective integer knapsack problem
Year of publication: |
2014
|
---|---|
Authors: | Rong, Aiying ; Figueira, José Rui |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 236.2014, 1 (1.7.), p. 85-99
|
Subject: | Multi-objective optimization | Integer knapsack problems | Dynamic programming | Bound sets | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Dynamische Optimierung | Mathematische Optimierung | Mathematical programming | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis |
-
Network models for multiobjective discrete optimization
Bergman, David, (2022)
-
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
Cerqueus, Audrey, (2015)
-
Branch-and-bound and objective branching with three or more objectives
Forget, Nicolas, (2022)
- More ...
-
Rong, Aiying, (2015)
-
A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
Rong, Aiying, (2013)
-
Dynamic programming algorithms for the bi-objective integer knapsack problem
Rong, Aiying, (2014)
- More ...