✦ LIBER ✦

An efficient algorithm for the complete set partitioning problem

✍ Scribed by Chien-Hua M. Lin; Harvey M. Salkin

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 439 KB
Volume: 6
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(83)90069-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient parallel algorithm for the

An efficient parallel algorithm for the single function coarsest partition problem

✍ Joseph F. Jájá; Kwan Woo Ryu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 1006 KB

A set-partitioning-based exact algorithm

A set-partitioning-based exact algorithm for the vehicle routing problem

✍ Yogesh Agarwal; Kamlesh Mathur; Harvey M. Salkin 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 899 KB

Efficient algorithms for some path parti

Efficient algorithms for some path partitioning problems

✍ Peter Brucker 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 471 KB

Efficient algorithm for graph-partitioni

Efficient algorithm for graph-partitioning problem using a problem transformation method

✍ C.-H. Lee; C.-I. Park; M. Kim 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 717 KB

An algorithm for set covering problem

✍ J.E. Beasley 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 763 KB

An efficient clustering algorithm for pa

An efficient clustering algorithm for partitioning parallel programs

✍ Piyush Maheshwari; Hong Shen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 254 KB

This paper presents a clustering algorithm that partitions node-labelled and edge-labelled Ž . directed acyclic precedence graphs APG into clusters such that all the clusters have balanced amount of computation load and there is only one communication path between any pair of clusters. The algorithm