Tree Elaboration Strategies In Branch and Bound Algorithms For Solving the Quadratic Assignment Problem

@inproceedings{Hahn1999TreeES,
  title={Tree Elaboration Strategies In Branch and Bound Algorithms For Solving the Quadratic Assignment Problem},
  author={Peter M. Hahn and William L. Hightower and T. A. Johnson and Monique Guignard-Spielberg},
  year={1999}
}
2 ABSTRACT This paper presents a new strategy for selecting nodes in a branch-and-bound algorithm for solving exactly the Quadratic Assignment Problem (QAP). It was developed when it was learned that older strategies failed on the larger size problems. The strategy is a variation of polytomic depth-first search of Mautor and Roucairol which extends a node by all assignments of an unassigned facility to unassigned locations based upon the counting of 'forbidden' locations. A forbidden location… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 29 CITATIONS, ESTIMATED 33% COVERAGE

92 Citations

051015'98'03'09'15
Citations per Year
Semantic Scholar estimates that this publication has 92 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 37 REFERENCES

Minimization of Cost in Assignment of Codes to Data Transmission

  • P. M. Hahn
  • Ph.D. Dissertation, University of Pennsylvania,
  • 1968
Highly Influential
9 Excerpts

Lower Bounds for the Quadratic Assignment Problem Based Upon a Dual Formulation

  • P. M. Hahn, Grant, T.L
  • Operations Research,
  • 1998
Highly Influential
8 Excerpts

An Evaluation and Analysis of the Resolvent Sequence Method for Solving the Quadratic Assignment Problem

  • T. L. Grant
  • Master’s Thesis, University of Pennsylvania,
  • 1989
Highly Influential
5 Excerpts

Tree Elaboration Strategies In Branch and Bound Algorithms For Solving the Quadratic Assignment Problem

  • P. M. Hahn, W. Hightower, T. Johnson
  • SIAM, Atlanta, GA, May 12-15, .
  • 1999

Branching Strategies for a Quadratic Assignment Problem Branch and Bound Algorithm

  • P. M. Hahn, W. Hightower, T. Johnson
  • (invited) INFORMS’98, Montreal, April 29, .
  • 1998

Similar Papers

Loading similar papers…