Lower bounds for the bandwidth problem
Year of publication: |
2021
|
---|---|
Authors: | Rendl, Franz ; Sotirov, Renata ; Truden, Christian |
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. 135.2021, p. 1-9
|
Subject: | Bandwidth Problem | Graph partition | Semidefinite programming | Mathematische Optimierung | Mathematical programming | Mathematik | Mathematics | Graphentheorie | Graph theory |
-
An efficient semidefinite programming relaxation for the graph partition problem
Sotirov, Renata, (2014)
-
An SDP-based approach for computing the stability number of a graph
Gaar, Elisabeth, (2022)
-
Improving the linear relaxation of maximum k-cut with semidefinite-based constraints
Sousa, Vilmar Jefté Rodrigues de, (2019)
- More ...
-
Optimal allocation of defibrillator drones in mountainous regions
Wankmüller, Christian, (2020)
-
A Bayesian approach for predicting food and beverage sales in staff canteens and restaurants
Posch, Konstantin, (2022)
-
The merger of populations, the incidence of marriages, and aggregate unhappiness
Stark, Oded, (2011)
- More ...