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 | Heuristik | Heuristics | Theorie | Theory | Data Mining | Dekompositionsverfahren | Decomposition method | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Ganzzahlige Optimierung | Integer programming | Scheduling-Verfahren | Scheduling problem |
-
Models and algorithms for the product pricing with single-minded customers requesting bundles
Bucarey, Víctor, (2021)
-
Silva, Allyson, (2021)
-
Decomposition based hybrid metaheuristics
Raidl, Günther, (2015)
- More ...
-
A note on computational aspects of the Steiner traveling salesman problem
Álvarez-Miranda, Eduardo, (2018)
-
Mixed-integer programming approaches for the time-constrained maximal covering routing problem
Sinnl, Markus, (2021)
-
A note on computational approaches for the antibandwidth problem
Sinnl, Markus, (2021)
- More ...