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 | Ganzzahlige Optimierung | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory |
-
Population-based iterated greedy algorithm for the S-labeling problem
Lozano, Manuel, (2023)
-
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)
- 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 ...