✦ LIBER ✦

Analysis of a heuristic algorithm for planar assignment problem

✍ Scribed by Shoichiro Yamada; Katsumi Harashima; Tamotsu Kasai

Book ID: 112075546
Publisher: John Wiley and Sons
Year: 1987
Tongue: English
Weight: 572 KB
Volume: 70
Category: Article
ISSN: 8756-6621
DOI: 10.1002/ecja.4410700601

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comparing heuristic algorithms of the pl

Comparing heuristic algorithms of the planar storage location assignment problem

✍ Changkyu Park; Junyong Seo 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 470 KB

A heuristic algorithm for a pin assignme

A heuristic algorithm for a pin assignment problem of gate array LSI

✍ Masahiro Fukui; Shuji Tsukiyama; Isao Shirakawa 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 851 KB

An analysis of a decomposition heuristic

An analysis of a decomposition heuristic for the assignment problem

✍ David Avis; Luc Devroye 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 214 KB

The Probabilistic Analysis of a Heuristi

The Probabilistic Analysis of a Heuristic for the Assignment Problem

✍ Avis, David; Lai, C. W. 📂 Article 📅 1988 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 850 KB

Heuristic Algorithm with Oscillation Str

Heuristic Algorithm with Oscillation Strategy for a New Class of Assignment Problem

✍ Jia-xiang LUO; Li-xin TANG; Yue-ming HU 📂 Article 📅 2009 🏛 Elsevier ⚖ 244 KB

A new class of assignment problem which roots in the optimization management of slabs in steel industry is considered in this article. Compared with the generalized assignment problem, flow constraints should be considered in this problem besides the capacity constraints when assigning items to knap

An algorithm for the planar three-index

An algorithm for the planar three-index assignment problem

✍ D. Magos; P. Miliotis 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 743 KB