Resources

Local Public Transport in Milan, Italy

Heatmap of bus, tram, and metro stops: Milan.

Graph Coloring Bibliography, Software, and Benchmarks

See the related web-page.

The Generalized Balanced Academic Curriculum Problem

See the related web-page.

Minimum Changeover Cost Arborescence

The following instances are obtained using the graphs in the SteinLib, named es10fst, es20fst, es30fst, B, and I080. The instances named XXX.u.5.dat have uniform unitary costs and 5 colors, while the instances named XXX.d.k.dat have k colors. Some of these instances are challenging.

Download [here] all the 341 instances of MinCCA. The compressed file contains a README file with the instructions on the instance format. Computational results are presented in the technical report:

G. Galbiati, S. Gualandi, F. Maffioli. On Minimum Changeover Cost Arborescences. Optimization Online, E-Print ID: 2011-09-3166. [abstract] [preprint]

The k-Clustering Minimum Biclique Completion problem

A new data set is available [here] (updated April. 2014).

MaxCUT-LU

The following are the resources used in the paper:

G. Galbiati, S. Gualandi, F. Maffioli. Computational Experience with a SDP-based Algorithm for Maximum Cut with Limited Unbalance. Networks, 55(3):247-255, 2010. [doi]

Planted graph generator: source code - Planted graph with 2000 nodes and 1153790 edges: planted (size: 12MB)

Random graph with 800 nodes and 79900 edges: rnd_graph_800 (size: 989KB)

Circuit design graph with 915 nodes and 1954 edges: circuit design (size: 20KB)

All the Gn graphs can be generated with rudy or downloaded [here]

The Unconstrained Maximum Cut and the Unconstrained Quadratic Binary Programming instances can be downloaded [here]