✦ LIBER ✦

A shortest-path algorithm for solving the fleet management problem in underground mines

✍ Scribed by Michel Gamache; Renaud Grimard; Paul Cohen

Book ID: 108116802
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 393 KB
Volume: 166
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2004.03.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 dual algorithm for the constrained sho

A dual algorithm for the constrained shortest path problem

✍ Gabriel Y. Handler; Israel Zang 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 878 KB

NC algorithms for dynamically solving th

NC algorithms for dynamically solving the all pairs shortest paths problem and related problems

✍ Weifa Liang; Brendan D. McKay; Hong Shen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 728 KB

Solving the undirected multicommodity fl

Solving the undirected multicommodity flow problem using a shortest path-based pricing algorithm

✍ Richard D. McBride; John W. Mamer 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 101 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 Incremental Algorithm for a Generaliz

An Incremental Algorithm for a Generalization of the Shortest-Path Problem

✍ G. Ramalingam; Thomas Reps 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 363 KB

The grammar problem, a generalization of the single-source shortest-path prob-Ž Ž . Ž . . lem introduced by D. E. Knuth Inform. Process. Lett. 6 1 1977 , 1᎐5 is to compute the minimum-cost derivation of a terminal string from each nonterminal of a given context-free grammar, with the cost of a deriv