Multi-objective and multi-constrained non-additive shortest path problems (Q609807): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2010.08.003 / rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/cor/ReinhardtP11 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2010.08.003 / rank | |||
Normal rank | |||
Latest revision as of 22:32, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multi-objective and multi-constrained non-additive shortest path problems |
scientific article |
Statements
Multi-objective and multi-constrained non-additive shortest path problems (English)
0 references
1 December 2010
0 references
multi objective programming
0 references
shortest path problem
0 references
non-additive objective
0 references
dynamic programming
0 references
0 references
0 references
0 references
0 references
