scientific article; zbMATH DE number 2080192

zbMath1044.90500MaRDI QIDQ4472434

Martin Grötschel

Publication date: 4 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1974/19740081.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (1)

A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem

This page was built for publication: