An edition of Dynamic programming subroutines based on the Dijkstra algorithm for finding minimum cost paths in directed networks (1975)

Dynamic programming subroutines based on the Dijkstra algorithm for finding minimum cost paths in directed networks

by

Dynamic programming subroutines based on the ...
Gary H. Elsner, Gary H. Elsner
Locate

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today
Notes
Notes

Buy this book

Last edited by WorkBot
December 10, 2009 | History
Edit
An edition of Dynamic programming subroutines based on the Dijkstra algorithm for finding minimum cost paths in directed networks (1975)

Dynamic programming subroutines based on the Dijkstra algorithm for finding minimum cost paths in directed networks

by

This work doesn't have a description yet. Can you add one?

Publish Date
Publisher
Forest Fire Research Institute
Language
English
Pages
16

Buy this book

Edition Availability
Cover of: Dynamic programming subroutines based on the Dijkstra algorithm for finding minimum cost paths in directed networks
Dynamic programming subroutines based on the Dijkstra algorithm for finding minimum cost paths in directed networks
1975, Forest Fire Research Institute
in English

Add another edition?

Book Details

Edition Notes

Published in
Ottawa, Ont
Series
Forest Fire Research Institute (Canada) Information report FF-X -- 51

Classifications

Library of Congress
MLCM 2008/42582 (T)

The Physical Object

Pagination
16 p. ;
Number of pages
16

Edition Identifiers

Open Library
OL17080904M
LCCN
2008396245

Work Identifiers

Work ID
OL7191777W

Source records

Library of Congress MARC record

Community Reviews (0)

No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON
December 10, 2009 Created by WorkBot add works page