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)
-
A dynamic programming heuristic for the quadratic knapsack problem
Fomeni, Franklin Djeumou, (2014)
-
Coil batching to improve productivity and energy utilization in steel production
Tang, Lixin, (2016)
- More ...
-
Compressed data structures for bi-objective {0,1}-knapsack problems
Correia, Pedro, (2018)
-
On the multicriteria allocation problem
Stiglmayr, Michael, (2014)
-
Multicriteria 0-1 knapsack problems with k-min objectives
Rong, Aiying, (2013)
- More ...