{"ref":"refs/heads/master","push_id":54169796,"commits":[{"sha":"61105f726d025d84a4b467ae6aaa24359ba6fc3a","author":{"email":"f1c3082c9def1c7cee43850c0310caee858f0e10@rwth-aachen.de","name":"Gereon"},"url":"https://api.github.com/repos/nafur/optiB/commits/61105f726d025d84a4b467ae6aaa24359ba6fc3a","message":"renamed tsp to christofides"},{"sha":"c8462ef7f59daf81387f200a0f96bc0daf19acf0","author":{"email":"f1c3082c9def1c7cee43850c0310caee858f0e10@rwth-aachen.de","name":"Gereon"},"url":"https://api.github.com/repos/nafur/optiB/commits/c8462ef7f59daf81387f200a0f96bc0daf19acf0","message":"added a new heuristic for tsp:\n\tstart with some hamilton cycle\n\tcompare two edges\n\t\tif other connections between the 4 nodes are shorter and graph is still connected, replace edges\n\tuntil no changes occur on all edge combinations\n\nthis heuristic actually yields a better result than christofides (YEAH!)"}],"head":"c8462ef7f59daf81387f200a0f96bc0daf19acf0","size":2}