Bi-dimensional knapsack problems with one soft constraint
| Year of publication: |
February
|
|---|---|
| Authors: | Schulze, Britta ; Paquete, Luís F. ; Klamroth, Kathrin ; 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. 78.2017, p. 15-26
|
| Subject: | Bi-dimensional knapsack problem | Bi-objective knapsack problem | Sensitivity analysis | Soft constraints | Dynamic programming | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Dynamische Optimierung |
-
Tolerance analysis for 0-1 knapsack problems
Pisinger, David, (2017)
-
Network models for multiobjective discrete optimization
Bergman, David, (2022)
-
Numerically safe lower bounds for the capacitated vehicle routing problem
Fukasawa, Ricardo, (2017)
- More ...
-
Compressed data structures for bi-objective {0,1}-knapsack problems
Correia, Pedro, (2018)
-
On the computational complexity of ordinal multi-objective unconstrained combinatorial optimization
Figueira, José Rui, (2025)
-
On the multicriteria allocation problem
Stiglmayr, Michael, (2014)
- More ...