All 0-1 Polytopes are Traveling Salesman Polytopes.

Louis J. Billera Aravamuthan Sarangarajan

Published in: Comb. (1996)

Keyphrases

traveling salesman
convex hull
lattice points
packing problem
traveling salesman problem
valid inequalities
neural network
feature selection
multi class
extreme points
optimal solution
nearest neighbor
global optimization