✦ LIBER ✦

An exact branch-and-bound procedure for the quadratic-assignment problem

✍ Scribed by M. S. Bazaraa; A. N. Elshafei

Publisher: John Wiley and Sons
Year: 1979
Tongue: English
Weight: 927 KB
Volume: 26
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800260111

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-bound-based heuristic for s

A branch-and-bound-based heuristic for solving the quadratic assignment problem

✍ M. S. Bazaraa; O. Kirca 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 897 KB

An LC branch-and-bound algorithm for the

An LC branch-and-bound algorithm for the module assignment problem

✍ Maw-Sheng Chern; G.H. Chen; Pangfeng Liu 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 707 KB

Constructive bounds and exact expectatio

Constructive bounds and exact expectations for the random assignment problem

✍ Don Coppersmith; Gregory B. Sorkin 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB

The random assignment problem is to choose a minimum-cost perfect matching in a complete n = n bipartite graph, whose edge weights are chosen randomly from some distribution such as the exponential distribution with mean 1. In this case it is known that the expectation does not grow unboundedly with

An ejection chain algorithm for the quad

An ejection chain algorithm for the quadratic assignment problem

✍ Cesar Rego; Tabitha James; Fred Glover 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 397 KB

Some branch-and-bound procedures for fix

Some branch-and-bound procedures for fixed-cost transportation problems

✍ A. Victor Cabot; S. Selcuk Erenguc 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 504 KB

An improved branch and bound procedure f

An improved branch and bound procedure for n × m flow shop problems

✍ S. S. Panwalkar; A. W. Khan 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB