Lecture Notes in Computer Science

2020

DOI: 10.1007/978-3-030-53262-8_20

|View full text |Cite

|

Sign up to set email alerts

|

Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem

¹

,

²

,

Yutaro Yamaguchi

³

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

0

Mentioning

0

Contrasting

0

Year Published

2020

2020

2021

2021

Publication Types

Select...

Book2

Article1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

References 10 publications

Supporting

0

Mentioning

0

Contrasting

0

Order By: Relevance

Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem

¹

,

²

,

³

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

No abstract

Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem

¹

,

²

,

³

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

No abstract

Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem

¹

,

²

,

³

2021

View full text Add to dashboard Cite

No abstract

Shortest Route Application via Dynamic Programming in the Transportation Networks

¹

,

²

,

³

et al. 2021

Advances in Logistics, Operations, and Management Science

View full text Add to dashboard Cite

The purpose of this study is to develop an application for finding the shortest path in the transportation sector. The application was developed using the dynamic programming method in MS Excel Visual Basic application. These types of problems are also called stagecoach problems. The purpose of the problem is finding the shortest path between the starting point (node) and the destination point. Values are related to the roads in the network to specify the distance between two nodes. In case of a small number of nodes (activities), a solution can be reached by evaluating all options. But the number of possible options to be scanned for real problems is quite large. In such cases, a suitable method is needed for the solution. It can produce effective solutions with the dynamic programming approach.

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Product

Browser Extension Assistant by scite Citation Statement Search Reference Check Visualizations Dashboards Explore Journals Explore Organizations Explore Funders Embedding Badge Embedding Citation Search Pricing

Resources

Blog Help & FAQ Accessibility Statement API Terms For Universities & Governments For Researchers For Publishers For Corporate, Pharma & Enterprise Author Marketing Become an Affiliate Get an organization trial or quote scite Data & Services

About

News & Press Careers Read our Paper Coverage

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Copyright © 2024 scite LLC. All rights reserved.

Made with 💙 for researchers

Part of the Research Solutions Family.