The quadratic shortest path problem: complexity, approximability, and solution methods (Q1754341)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The quadratic shortest path problem: complexity, approximability, and solution methods |
scientific article; zbMATH DE number 6876716
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The quadratic shortest path problem: complexity, approximability, and solution methods |
scientific article; zbMATH DE number 6876716 |
Statements
The quadratic shortest path problem: complexity, approximability, and solution methods (English)
0 references
30 May 2018
0 references
combinatorial optimization
0 references
shortest path problem
0 references
quadratic 0-1 optimization
0 references
computational complexity
0 references
branch-and-bound
0 references
0 references
0 references
0.8518176078796387
0 references
0.8461167812347412
0 references
0.7492669820785522
0 references
0.7471963167190552
0 references
