Empirical orthogonal constraint generation for Multidimensional 0/1 Knapsack Problems
Year of publication: |
2020
|
---|---|
Authors: | Setzer, Thomas ; Blanc, Sebastian M. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 282.2020, 1 (1.4.), p. 58-70
|
Subject: | Constraint generation | Dimension reduction | Multidimensional Knapsack Problem | Branch-and-Bound | Branch and Bound | Ganzzahlige Optimierung | Integer programming | USA | United States | Theorie | Theory |
Description of contents: | Description [sciencedirect.com] |
Type of publication: | Article |
---|---|
Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
Language: | English |
Notes: | Corrigendum enthalten in: Volume 262, Issue 2, 16. October 2020, Seite 791-795 |
Other identifiers: | 10.1016/j.ejor.2019.09.016 [DOI] |
Source: | ECONIS - Online Catalogue of the ZBW |
-
Experiments with parallel algorithms for combinatorial problems
Kindervater, G. A. P., (1988)
-
Labeling algorithms for multiple objective integer knapsack problems
Figueira, José Rui, (2010)
-
LP bounds in various constraint programming approaches for orthogonal packing
Mesyagutov, Marat, (2012)
- More ...
-
When to choose the simple average in forecast combination
Blanc, Sebastian M., (2016)
-
Bias-variance trade-off and shrinkage of weights in forecast combination
Blanc, Sebastian M., (2020)
-
Analytical debiasing of corporate cash flow forecasts
Blanc, Sebastian M., (2015)
- More ...