Algorithmic expedients for the S-labeling problem
Year of publication: |
2019
|
---|---|
Authors: | Sinnl, Markus |
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. 108.2019, p. 201-212
|
Subject: | Graph labeling | Branch-and-cut | Lagrangian relaxation | Constraint programming | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory |
-
A note on computational approaches for the antibandwidth problem
Sinnl, Markus, (2021)
-
Population-based iterated greedy algorithm for the S-labeling problem
Lozano, Manuel, (2023)
-
Two-dimensional phase unwrapping via balanced spanning forests
Herszterg, Ian, (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)
-
Interdiction games and monotonicity, with application to knapsack problems
Fischetti, Matteo, (2019)
- More ...