Polarity and the complexity of the shooting experiment

Authors:
Brady Hunsaker;Ellis L. Johnson;Craig A. Tovey
Affiliations:
Department of Industrial Engineering, University of Pittsburgh, United States;School of Industrial and Systems Engineering, Georgia Institute of Technology, United States;School of Industrial and Systems Engineering, Georgia Institute of Technology, United States
Venue:
Discrete Optimization
Year:
2008

Citing 5
Cited 0

Optimal attack and reinforcement of a network

Journal of the ACM (JACM)
Theory of linear and integer programming

Theory of linear and integer programming
On the complexity of computing the volume of a polyhedron

SIAM Journal on Computing
Measuring facets of polyhedra to predict usefulness in branch-and-cut algorithms

Measuring facets of polyhedra to predict usefulness in branch-and-cut algorithms
A note on the traveling salesman problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We exhibit a polar relationship between two measures that have been proposed to evaluate the importance of TSP facets, the Kuhn-Gomory shooting experiment size and the probability of integrality in an augmented LP relaxation. The polarity establishes the complexity of performing the shooting experiment. We illustrate the resulting relationship on the Chinese postman and minimum spanning set problems.