Some results on node lifting of TSP inequalities
We can define important classes of TSP inequalities by performing Naddef and Rinaldi's node lifting operation on simple TSP inequalities. We present some new insights into the node lifting operation, namely that 1-node lifting of cut based inequalities always has a geometric interpretation if a certain claw-free condition which is satisfied by most of these TSP inequalities is met. We go on to show that node lifting of the subtour elimination inequalities does not yield any new inequalities.
node lifting lifting inequalities traveling salesman problem polytope