Improving problem reduction for 0-1 multidimensional Knapsack problems with valid inequalities
Year of publication: |
July 2016
|
---|---|
Authors: | Gu, Hanyu |
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. 71.2016, p. 82-89
|
Subject: | Multidimensional Knapsack Problem | Core problem | Global Lifted Cover Inequalities | Heuristic algorithm | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming |
-
Al-Shihabi, Sameh, (2025)
-
Wang, Ruicheng, (2025)
-
A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
Cacchiani, Valentina, (2017)
- More ...
-
Study on constraint scheduling algorithm for job shop problems with multiple constraint machines
Zuo, Yan, (2008)
-
Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom
Czibula, Oliver G., (2016)
-
A multi-stage IP-based heuristic for class timetabling and trainer rostering
Czibula, Oliver, (2017)
- More ...