On a biobjective search problem in a line: formulations and algorithms (Q393048)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6245999
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a biobjective search problem in a line: formulations and algorithms |
scientific article; zbMATH DE number 6245999 |
Statements
On a biobjective search problem in a line: formulations and algorithms (English)
0 references
16 January 2014
0 references
multiobjective combinatorial optimization
0 references
dynamic programming
0 references
shortest path problems
0 references
knapsack problems
0 references
0 references
0.9327964186668396
0 references
0.757413387298584
0 references
