Integer knapsack problems with profit functions of the same value range
| Year of publication: |
2023
|
|---|---|
| Authors: | Gurevsky, Evgeny ; Kopelevich, Dmitry ; Kovalev, Sergey ; Kovalyov, Mikhail Y. |
| Published in: |
4OR : quarterly journal of the Belgian, French and Italian Operations Research Societies. - Berlin : Springer, ISSN 1614-2411, ZDB-ID 2106212-2. - Vol. 21.2023, 3, p. 405-419
|
| Subject: | Convex optimization | FPTAS | Knapsack problem | Median finding | NP-hardness | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming |
-
A 3-space dynamic programming heuristic for the cubic knapsack problem
Dan Dije, Ibrahim, (2024)
-
Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint
Halman, Nir, (2023)
-
Halman, Nir, (2018)
- More ...
-
Scheduling electric vehicle regular charging tasks : a review of deterministic models
Dolgui, Alexandre, (2025)
-
Single machine scheduling with assignable due dates to minimize maximum and total late work
Justkowiak, Jan-Erik, (2023)
-
A note on scheduling identical parallel machines with preemptions and setup times
Boudhar, Mourad, (2025)
- More ...