On some interconnections between combinatorial optimization and extremal graph theory

DOI10.2298/YJOR0402147CzbMath1274.05239OpenAlexW2044393101MaRDI QIDQ4928212

Pierre Hansen, Vera V. Kovacevic-Vujcic, Dragos Cvetković

Publication date: 10 June 2013

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/yjor0402147c

zbMATH Keywords

mathematical programmingvariable neighborhood search

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Related Items

Computing the metric dimension of graphs by genetic algorithms ⋮ Maximizing the spectral radius of \(k\)-connected graphs with given diameter ⋮ On the Moore-Penrose pseudo-inversion of block symmetric matrices and its application in the graph theory ⋮ Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph ⋮ On bags and bugs ⋮ On construction of upper and lower bounds for the HOMO-LUMO spectral gap

Uses Software

• nauty