The min-Knapsack problem with compactness constraints and applications in statistics
Year of publication: |
2024
|
---|---|
Authors: | Santini, Alberto ; Malaguti, Enrico |
Published in: |
European journal of operational research : EJOR. - Amsterdam [u.a.] : Elsevier, ISSN 0377-2217, ZDB-ID 1501061-2. - Vol. 312.2024, 1 (1.1.), p. 385-397
|
Subject: | Applications in statistics | Cutting | Dynamic programming | Knapsack problems | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Dynamische Optimierung | Ganzzahlige Optimierung | Integer programming | Statistische Methode | Statistical method |
-
A dynamic programming heuristic for the quadratic knapsack problem
Fomeni, Franklin Djeumou, (2014)
-
A lifted-space dynamic programming algorithm for the Quadratic Knapsack Problem
Djeumou Fomeni, Franklin, (2021)
-
A dynamic programming algorithm for the Knapsack problem with setup
Chebil, Khalil, (2014)
- More ...
-
The traveling salesman problem with pickups, deliveries, and draft limits
Malaguti, Enrico, (2018)
-
An exact algorithm for the Partition Coloring Problem
Furini, Fabio, (2018)
-
A note on selective line-graphs and partition colorings
Cornaz, Denis, (2019)
- More ...