✦ LIBER ✦

A genetic algorithm for finding a path subject to two constraints

✍ Scribed by Lu, Ting; Zhu, Jie

Book ID: 120483187
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 656 KB
Volume: 13
Category: Article
ISSN: 1568-4946
DOI: 10.1016/j.asoc.2012.10.018

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient algorithm for finding a pat

An efficient algorithm for finding a path subject to two additive constraints

✍ Turgay Korkmaz; Marwan Krunz; Spyros Tragoudas 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 616 KB

One of the key issues in providing end-to-end quality-of-service (QoS) guarantees in packet networks is how to determine a feasible path that satis®es a number of QoS constraints. For two or more additive constraints, the problem of ®nding a feasible path is NP-complete that cannot be exactly solved

Improved approximation algorithms for co

Improved approximation algorithms for computing\(k\)disjoint paths subject to two constraints

✍ Guo, Longkun; Shen, Hong; Liao, Kewen 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 287 KB

A General Algorithm for Finding a Shorte

A General Algorithm for Finding a Shortest Path between two n-Configurations

✍ M.C. Er 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 254 KB

A constraint algorithm for singular Lagr

A constraint algorithm for singular Lagrangians subjected to nonholonomic constraints

✍ de León, Manuel; de Diego, David Martı́n 📂 Article 📅 1997 🏛 American Institute of Physics 🌐 English ⚖ 335 KB

A genetic algorithm for finding the k sh

A genetic algorithm for finding the k shortest paths in a network

✍ Ahmed Younes Hamed 📂 Article 📅 2010 🏛 Elsevier 🌐 English ⚖ 801 KB

A path-finding algorithm for loop-free r

A path-finding algorithm for loop-free routing

✍ Garcia-Luna-Aceves, J.J.; Shree Murthy 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 404 KB