Advertisement

Quadratic Assignment Polytopes

  • Manfred Padberg
  • Minendra P. Rijal
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 3)

Abstract

In this chapter we present various results and partial results on the facial structure of the quadratic assignment polytope QAP n and its symmetric relative, the polytope SQP n . We address primarily the questions of finding the affine hull and the dimension of the respective polytopes, but give also some valid inequalities for QAP n . Some of these problems are left open and suggested in the form of conjectures for future work on this difficult, but interesting class of combinatorial optimization problems.

Keywords

Valid Inequality Quadratic Assignment Problem Linear Description Mixed Integer Programming Problem Clique Inequality 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • Manfred Padberg
    • 1
  • Minendra P. Rijal
    • 1
    • 2
  1. 1.New York UniversityNew YorkUSA
  2. 2.Tribhuvan UniversityKathmanduNepal

Personalised recommendations