The maximum k-colorable subgraph problem and related problems
Year of publication: |
2022
|
---|---|
Authors: | Kuryatnikova, Olga ; Sotirov, Renata ; Vera, Juan C. |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 1, p. 656-669
|
Subject: | semidefinite programming | chromatic number of a graph | generalized theta number | Hamming graphs | Johnson graphs | k-colorable subgraph problem | stable set | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
On bounding the bandwidth of graphs with symmetry
Dam, Edwin Robert van, (2015)
-
Stable set reformulations for the degree preserving spanning tree problem
Lucena, Abílio, (2024)
-
Guimarães, Dilson Almeida, (2020)
- More ...
-
The many faces of positivity to approximate structured optimization problems
Kuryatnikova, Olga, (2019)
-
Static-Arbitrage Bounds on the Prices of Basket Options via Linear Programming
Peña, Javier F., (2006)
-
Computing arbitrage upper bounds on basket options in the presence of bid–ask spreads
Peña, Javier, (2012)
- More ...