A note on computational approaches for the antibandwidth problem
Year of publication: |
2021
|
---|---|
Authors: | Sinnl, Markus |
Published in: |
Central European journal of operations research. - Heidelberg : Physica-Verl., ISSN 1613-9178, ZDB-ID 2093829-9. - Vol. 29.2021, 3, p. 1057-1077
|
Subject: | Graph labeling | Integer programming | Constraint programming | Clique problem | Bandwidth | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Graphentheorie | Graph theory |
-
Feasibility check for the distance geometry problem : an application to molecular conformations
Agra, Agostinho, (2017)
-
Algorithmic expedients for the S-labeling problem
Sinnl, Markus, (2019)
-
Least-cost influence maximization on social networks
Günneç, Dilek, (2020)
- 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)
-
Large-scale influence maximization via maximal covering location
Güney, Evren, (2021)
- More ...