Nearest route problem (Q1584634): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jmaa.2000.6933 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2014874590 / rank | |||
Normal rank | |||
Revision as of 19:29, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nearest route problem |
scientific article |
Statements
Nearest route problem (English)
0 references
14 October 2001
0 references
The author presents a straightforward dynamic programming approach for the following multistage optimization problem: given a target value, find a sequence of decisions such that the final outcome is as close as possible to the target value. The paper is illustrated by an example concerning paths in a layered network whose lengths should be as close as possible to a prescribed value (``nearest route problem'').
0 references
nearest route problem
0 references
dynamic programming
0 references
