Using the Dimension Reduction Technique to Prove that Clique Trees Define Facets for the Asymmetric Traveling Salesman Polytope.

Abstract

In this paper the author develops a new general approach to proving that a given inequality is facet-defining. This approach is then used to show that clique tree inequalities define facets for the asymmetric traveling salesman problem.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 14, 1994
Accession Number
ADA289397

Entities

People

  • Bob Carr

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Computer Programs
  • Computers
  • Dimensionality Reduction
  • Equations
  • Inequalities
  • Mathematics
  • Military Research
  • Numbers
  • Schools
  • Symmetry
  • Universities

Readers

  • Graph Algorithms and Convex Optimization.
  • Operations Research