On the cores of games arising from integer edge covering functions of graphs
Year of publication: |
2013
|
---|---|
Authors: | Park, Boram ; Kim, Suh-ryung ; Kim, Hye Kyung |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 26.2013, 4, p. 786-798
|
Subject: | Integer edge covering problems on graphs | Integer edge covering functions of graphs | Edge covering problems | Decomposition theorems | Graphentheorie | Graph theory | Ganzzahlige Optimierung | Integer programming | Mathematik | Mathematics | Mathematische Optimierung | Mathematical programming | Core |
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
On the lattice programming gap of the group problems
Aliev, Iskander, (2015)
-
Finding maximum subgraphs with relatively large vertex connectivity
Veremyev, Alexander, (2014)
- More ...
-
On the possible scientific laws
Kim, Suh-Ryung, (1990)
-
Kim, Hye Kyung, (2013)
-
Fang, Qizhi, (2005)
- More ...