✦ LIBER ✦

An efficient implementation of local search algorithms for constrained routing problems

✍ Scribed by M.W.P. Savelsbergh

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 691 KB
Volume: 47
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(90)90091-o

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient algorithm for solving const

An efficient algorithm for solving constrained nonlinear programming problems

✍ Bruce R. Feiring; Don T. Phillips 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 784 KB

An implementation of an efficient algori

An implementation of an efficient algorithm for bisimulation equivalence

✍ Jean-Claude Fernandez 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 943 KB

An efficient hybrid algorithm for the op

An efficient hybrid algorithm for the optimization of problems with several local minima

✍ P. Alotto; M. A. Nervi 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 372 KB 👁 2 views

An efficient implementation of an algori

An efficient implementation of an algorithm for findingK shortest simple paths

✍ Hadjiconstantinou, E.; Christofides, N. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 263 KB 👁 1 views

In this article, we present an efficient computational implementation of an algorithm for finding the K shortest simple paths connecting a pair of vertices in an undirected graph with n vertices, m arcs, and nonnegative arc lengths. A minimal number of intermediate paths is formed based on the metho

A parallel implementation of the TSSP +

A parallel implementation of the TSSP + 1 decomposition for the capacity-constrained vehicle routing problem

✍ Melissa Bowers; Charles E. Noon; Benjamin Thomas 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 785 KB

Comparing the performance of the genetic

Comparing the performance of the genetic and local search algorithms for solving the satisfiability problems

✍ Yousef Kilani 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 330 KB