On some interconnections between combinatorial optimization and extremal graph theory

DOI10.2298/YJOR0402147CMaRDI QIDQ4928212zbMATH OpenOpenAlexFDO

Authors Pierre Hansen, Dragoš Cvetković, Vera Kovačević-Vujčić

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)

Recommendations

• Connections in combinatorial optimization
• scientific article; zbMATH DE number 2159270
• scientific article; zbMATH DE number 2191993
• Combinatorial optimization. Abstracts from the workshop held November 13--19, 2011.
• Combinatorial optimization. Abstracts from the workshop held November 4--10, 2018

Cited in

(7)

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

Describes a project that uses

Uses Software

• nauty

This page was built for publication: On some interconnections between combinatorial optimization and extremal graph theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928212)