✦ LIBER ✦

A spanning heuristic for the unordered and ordered matching identification problem

✍ Scribed by Douglas M. Kline; Charlene G. Riggle; Abraham Mehrez

Book ID: 113830378
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 221 KB
Volume: 33
Category: Article
ISSN: 0305-0483
DOI: 10.1016/j.omega.2004.07.012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A heuristic algorithm for the mini-max s

A heuristic algorithm for the mini-max spanning forest problem

✍ Takeo Yamada; Hideo Takahashi; Seiji Kataoka 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 401 KB

A hybrid heuristic for the diameter cons

A hybrid heuristic for the diameter constrained minimum spanning tree problem

✍ Abilio Lucena; Celso C. Ribeiro; Andréa C. Santos 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 363 KB

A survey of heuristics for the weighted

A survey of heuristics for the weighted matching problem

✍ David Avis 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 909 KB

This survey paper reviews results on heuristics for two weighted matching problems: matchings where the vertices are points in the plane and weights are Euclidean distances, and the assignment problem. Several heuristics are described in detail-and results are given for worst-case ratio bounds, abso

A heuristic manipulation technique for t

A heuristic manipulation technique for the sequential ordering problem

✍ R. Montemanni; D.H. Smith; L.M. Gambardella 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 275 KB

A repeated matching heuristic for the si

A repeated matching heuristic for the single-source capacitated facility location problem

✍ Mikael Rönnqvist; Suda Tragantalerngsak; John Holt 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 278 KB

Heuristic and randomized optimization fo

Heuristic and randomized optimization for the join ordering problem

✍ Michael Steinbrunn; Guido Moerkotte; Alfons Kemper 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 376 KB