Shortest Path Problem With Ordinary Di, erential Equations Con-strained

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Babapour Azar Ali; Hosseini Nodeh Zohreh

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Computational Methods for Differential Equations Year:2020 | Volume:8 | Issue:4 Page(s): 661-672

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Shortest Path Problem With Ordinary Di, erential Equations Con-strained

Author(s)

Babapour Azar Ali | Hosseini Nodeh Zohreh | Issue Writer Certificate

Keywords

Implicit method

Shortest path

Constrained di

erential equations

Abstract

Many quick-link optimization models of transferring corrosive materials, need some constraints to change the output space such that all of the criteria are met, which forms a nonlinear problem with speci, c constraints. So we use an approach for , nding global solutions of mixed-integer nonlinear optimization problems with ordinary di, erential equation constraints on the Shortest path problem connective body composition because we need to save time. For the solution of Constrained di, erential equations, we present a numerical method by coupling an implicit numerical method, and the results will be expressed by showing that the optimal path is selected.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Babapour Azar, Ali, & Hosseini Nodeh, Zohreh. (2020). Shortest Path Problem With Ordinary Di, erential Equations Con-strained. COMPUTATIONAL METHODS FOR DIFFERENTIAL EQUATIONS, 8(4), 661-672. SID. https://sid.ir/paper/1057653/en

Vancouver: Copy

Babapour Azar Ali, Hosseini Nodeh Zohreh. Shortest Path Problem With Ordinary Di, erential Equations Con-strained. COMPUTATIONAL METHODS FOR DIFFERENTIAL EQUATIONS[Internet]. 2020;8(4):661-672. Available from: https://sid.ir/paper/1057653/en

IEEE: Copy

Ali Babapour Azar, and Zohreh Hosseini Nodeh, “Shortest Path Problem With Ordinary Di, erential Equations Con-strained,” COMPUTATIONAL METHODS FOR DIFFERENTIAL EQUATIONS, vol. 8, no. 4, pp. 661–672, 2020, [Online]. Available: https://sid.ir/paper/1057653/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops