✦ LIBER ✦

A class of heuristic algorithms for the routing problem

✍ Scribed by L. S. Grigor’eva

Publisher: Springer US
Year: 1995
Tongue: English
Weight: 493 KB
Volume: 73
Category: Article
ISSN: 1573-8795
DOI: 10.1007/bf02367673

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Heuristic and exact algorithms for the m

Heuristic and exact algorithms for the multi-pile vehicle routing problem

✍ Fabien Tricoire; Karl F. Doerner; Richard F. Hartl; Manuel Iori 📂 Article 📅 2009 🏛 Springer 🌐 German ⚖ 348 KB

Exact and heuristic algorithms for routi

Exact and heuristic algorithms for routing problems

✍ Maria Battarra 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 95 KB

A GRASP heuristic for the delay-constrai

A GRASP heuristic for the delay-constrained multicast routing problem

✍ Nina Skorin-Kapov; Mladen Kos 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 413 KB

Approximation algorithms for a vehicle r

Approximation algorithms for a vehicle routing problem

✍ Sven O. Krumke; Sleman Saliba; Tjark Vredeveld; Stephan Westphal 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 403 KB

Heuristic algorithms for the multiple kn

Heuristic algorithms for the multiple knapsack problem

✍ S. Martello; P. Toth 📂 Article 📅 1981 🏛 Springer Vienna 🌐 English ⚖ 835 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