Shortest path problem with forbidden paths: the elementary version (Q2509518): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: DBLP publication ID (P1635): journals/eor/PuglieseG13, #quickstatements; #temporary_batch_1731483406851 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: NETGEN / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2012.11.010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058036230 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/eor/PuglieseG13 / rank | |||
Normal rank | |||
Latest revision as of 09:06, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shortest path problem with forbidden paths: the elementary version |
scientific article |
Statements
Shortest path problem with forbidden paths: the elementary version (English)
0 references
28 July 2014
0 references
combinatorial optimization
0 references
shortest paths
0 references
forbidden paths
0 references
branch and bound approach
0 references
dynamic programming approach
0 references
