𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Resource constrained assignment problems

✍ Scribed by Ronny Aboudi; Kurt Jørnsten

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
920 KB
Volume
26
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Constrained neural approaches to quadrat
Constrained neural approaches to quadratic assignment problems
✍ S. Ishii; M. Sato 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 167 KB

In this paper, we discuss analog neural approaches to the quadratic assignment problem (QAP). These approaches employ a hard constraints scheme to restrict the domain space, and are able to obtain much improved solutions over conventional neural approaches. Since only a few strong heuristics for QAP

Adjacency on the constrained assignment
Adjacency on the constrained assignment problem
✍ Abdo Y. Alfakih; Katta G. Murty 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 416 KB

Let Qc,, be the integer hull of the intersection of the assignment polytope with a given hyperplane H = {X = (xii) E Wx" : c:=, cJ=, ct,xij = r}. W e 5 .h ow that the problem of checking whether two given extreme points of Qc,r are nonadjacent c = (cl,) is a O-l matrix, and that it is NP-Complete if