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 |
-
Tolerance analysis for 0-1 knapsack problems
Pisinger, David, (2017)
-
A dynamic programming heuristic for the quadratic knapsack problem
Fomeni, Franklin Djeumou, (2014)
-
A lifted-space dynamic programming algorithm for the Quadratic Knapsack Problem
Fomeni, Franklin Djeumou, (2021)
- More ...
-
Decision space robustness for multi-objective integer linear programming
Stiglmayr, Michael, (2021)
-
Computing representations using hypervolume scalarizations
Paquete, Luís F., (2022)
-
On the rectangular knapsack problem : approximation of a specific quadratic knapsack problem
Schulze, Britta, (2020)
- More ...