Library

eCommons

 

The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision

Simple item page
dc.contributor.authorMitchell, J. S. B.en_US
dc.contributor.authorPapadimitriou, C. H.en_US
dc.date.accessioned2007-11-09T19:59:39Z
dc.date.available2007-11-09T19:59:39Z
dc.date.issued1990-01en_US
dc.description.abstractThe Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivisionen_US
dc.format.extent6661594 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.citation885en_US
dc.identifier.urihttps://hdl.handle.net/1813/8768
dc.language.isoen_USen_US
dc.publisherCornell University Operations Research and Industrial Engineeringen_US
dc.subjectOperations Researchen_US
dc.subjectIndustrial Engineeringen_US
dc.subjecttechnical reporten_US
dc.titleThe Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivisionen_US
dc.typetechnical reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR000885.pdf
Size:
6.35 MB
Format:
Adobe Portable Document Format
Download

Collections

ORIE Technical Reports