On the exact separation of cover inequalities of maximum depth
Year of publication: |
[2021]
|
---|---|
Authors: | Catanzaro, Daniele ; Coniglio, Stefano ; Furini, Fabio |
Publisher: |
Louvain-la-Neuve : CORE |
Subject: | Knapsack Problem | Cover Inequalities | Dynamic Programming | Mixed Integer Nonlinear Programming | Cutting Plane Generation | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Nichtlineare Optimierung | Nonlinear programming | Dynamische Optimierung | Dynamic programming | Einkommensverteilung | Income distribution |
-
Terzi, Mourad, (2024)
-
Bacci, Tiziano, (2024)
-
A 3-space dynamic programming heuristic for the cubic knapsack problem
Dan Dije, Ibrahim, (2024)
- More ...
-
A lexicographic pricer for the fractional bin packing problem
Coniglio, Stefano, (2019)
-
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo, (2019)
-
A new combinatorial branch-and-bound algorithm for the Knapsack problem with conflicts
Coniglio, Stefano, (2021)
- More ...