✦ LIBER ✦

A linear relaxation heuristic for the generalized assignment problem

✍ Scribed by Michael A. Trick

Publisher: John Wiley and Sons
Year: 1992
Tongue: English
Weight: 850 KB
Volume: 39
Category: Article
ISSN: 0894-069X
DOI: 10.1002/1520-6750(199203)39:2<137::aid-nav3220390202>3.0.co;2-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Heuristics for the multi-resource genera

Heuristics for the multi-resource generalized assignment problem

✍ Joseph B. Mazzola; Steven P. Wilcox 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

A parametric-based heuristic program for

A parametric-based heuristic program for the quadratic assignment problem

✍ D. J. White 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 529 KB

A multistart heuristic for the equality

A multistart heuristic for the equality generalized traveling salesman problem

✍ Valentina Cacchiani; Albert Einstein Fernandes Muritiba; Marcos Negreiros; Paolo 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 316 KB

A multifaceted heuristic for the oriente

A multifaceted heuristic for the orienteering problem

✍ B. L. Golden; Qiwen Wang; Li Liu 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 451 KB

Lagrangean decomposition/relaxation for

Lagrangean decomposition/relaxation for the routing and wavelength assignment problem

✍ Babacar Thiongane 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 220 KB

A tabu search heuristic for the Steiner

A tabu search heuristic for the Steiner Tree Problem

✍ Gendreau, Michel; Larochelle, Jean-Francois; Sans�, Brunilde 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 342 KB 👁 2 views

The Steiner Tree Problem (STP) in graphs is a well-known NP-hard problem. It has regained attention due to the introduction of new telecommunication technologies, such as ATM, since it appears as the inherent mathematical structure behind multicast communications. In this paper, we present a tabu se