✦ LIBER ✦

Label Correcting Methods to Solve Multicriteria Shortest Path Problems

✍ Scribed by F. Guerriero; R. Musmanno

Book ID: 110314711
Publisher: Springer
Year: 2001
Tongue: English
Weight: 114 KB
Volume: 111
Category: Article
ISSN: 0022-3239
DOI: 10.1023/a:1012602011914

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A parametric approach to solving bicrite

A parametric approach to solving bicriterion shortest path problems

✍ John Mote; Ishwar Murthy; David L. Olson 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 855 KB

A shortest augmenting path method for so

A shortest augmenting path method for solving minimal perfect matching problems

✍ Ulrich Derigs 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 551 KB

## Abstract An efficient procedure for solving minimum weight perfect matching problems is presented. Starting from the empty matching the optimal matching is constructed by successively augmenting along shortest augmenting paths. Such paths can be determined via a special labeling technique. The a

A genetic algorithms to solve the bicrit

A genetic algorithms to solve the bicriteria shortest path problem

✍ Cheikh Mohamed; Jarboui Bassem; Loukil Taicir 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 362 KB

A solution to histogram-equalization and

A solution to histogram-equalization and other related problems by shortest path methods

✍ Sukhamay Kundu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 270 KB

A simplification of the double-sweep alg

A simplification of the double-sweep algorithm to solve the k-shortest path problem

✍ K.A. Rink; E.Y. Rodin; V. Sundarapandian 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 796 KB

An optimal algorithm to solve the all-pa

An optimal algorithm to solve the all-pair shortest path problem on interval graphs

✍ R. Ravi; Madhav V. Marathe; C. Pandu Rangan 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 646 KB