Exact and heuristic algorithms for the maximum weighted submatrix coverage problem
Year of publication: |
2022
|
---|---|
Authors: | Sinnl, Markus |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 298.2022, 3 (1.5.), p. 821-833
|
Subject: | Benders decomposition | Branch-and-cut | Combinatorial optimization | Data mining | Local search | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | Algorithmus | Algorithm | Dekompositionsverfahren | Decomposition method | Data Mining | Scheduling-Verfahren | Scheduling problem |
-
Silva, Allyson, (2021)
-
A decomposition based solution algorithm for u-type assembly line balancing with interval data
Hazır, Öncü, (2015)
-
Naderi, Bahman, (2020)
- More ...
-
A note on computational aspects of the Steiner traveling salesman problem
Álvarez-Miranda, Eduardo, (2018)
-
ILP heuristics and a new exact method for bi-objective 0/1 ILPs : application to FTTx-network design
Leitner, Markus, (2016)
-
A computational study of exact approaches for the bi-objective prize-collecting steiner tree problem
Leitner, Markus, (2015)
- More ...