Modeling and optimization of least-cost corridors

Given a grid of cells, each having a value indicating its cost per unit area, a variant of the least-cost path problem is to find a corridor of a specified width connecting two termini such that its cost-weighted area is minimized. A computationally efficient method exists for finding such corridor...

Full description

Bibliographic Details
Main Author: Seegmiller, Lindsi
Format: Others
Language:English
Published: KTH, Geoinformatik 2021
Subjects:
Online Access:http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-291279
http://nbn-resolving.de/urn:isbn:978-91-7873-797-0