Compressed data structures for bi-objective {0,1}-knapsack problems
Year of publication: |
January 2018
|
---|---|
Authors: | Correia, Pedro ; Paquete, Luís F. ; Figueira, José Rui |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 89.2018, p. 82-93
|
Subject: | Multi-objective optimization | Implicit enumeration techniques | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Jauny, (2023)
-
Stevanato, Nicolò, (2023)
-
Improved front steepest descent for multi-objective optimization
Lapucci, Matteo, (2023)
- More ...
-
Bi-dimensional knapsack problems with one soft constraint
Schulze, Britta, (2017)
-
Greedy algorithms for a class of knapsack problems with binary weights
Gorski, Jochen, (2012)
-
Paquete, Luís F., (2009)
- More ...