𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computational aspects of the maximum diversity problem

✍ Scribed by Jay B. Ghosh

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
418 KB
Volume
19
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Phylogenetic diversity and the maximum c
Phylogenetic diversity and the maximum coverage problem
✍ Vincent Moulton; Andreas Spillner πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 376 KB

For a weighted hypergraph (H, Ο‰), with vertex set X , edge set E, and weighting Ο‰ : E β†’ R β‰₯0 , the maximum coverage problem is to find a k-element subset Y βŠ† X that maximizes the total weight of those edges that have non-empty intersection with Y among all k-element subsets of X . Such a subset Y is

Computational aspects of the facility la
Computational aspects of the facility layout design problem
✍ Louis Caccetta; Yaya S. Kusumah πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 491 KB

This paper focuses on constructive graph theoretic based heuristics. We consider the facility layout problem where the objective is to maximize benefit. We briefly review the literature heuristics and present a new algorithm. Computational results, based on 600 randomly uniform generated problems, d

Ergonomic aspects of manβ€”computer proble
Ergonomic aspects of manβ€”computer problem solving
✍ T.F.M. Stewart πŸ“‚ Article πŸ“… 1974 πŸ› Elsevier Science 🌐 English βš– 422 KB

The paper reports a survey of interactive computer usage by designers, engineers, economists and other specialists in several industrial organisations. Sixty-nine of these specialists were interviewed about both hardware interface problems, eg, keyboard layout, and software interface problems, eg, h