activity
20162024
most citedProving hamiltonian properties in connected 4-regular graphs: an ILP-based approach

1 citations · 2 across the 4 of their papers we have counts for

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2023★ 1 cited

Orbits, schemes and dynamic programming procedures for the TSP 4-OPT neighborhood

Giuseppe Lancia, Marcello Dalpasso

We discuss the way to group all 25 possible 4-OPT moves into 7 orbits of equivalent moves. We then describe two implementations, one for a algorithm by de Berg's et al. an…

cs.DS2020

Symmetric Linear Programming Formulations for Minimum Cut with Applications to TSP

Robert D. Carr, Jennifer Iglesias, Giuseppe Lanciac +1

We introduce multiple symmetric LP relaxations for minimum cut problems. The relaxations give optimal and approximate solutions when the input is a Hamiltonian cycle. We show that…