Estimating optimal objective values for the TSP, VRP, and other combinatorial problems using randomization (Q6495409)
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: Estimating optimal objective values for the TSP, VRP, and other combinatorial problems using randomization |
scientific article; zbMATH DE number 7841046
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Estimating optimal objective values for the TSP, VRP, and other combinatorial problems using randomization |
scientific article; zbMATH DE number 7841046 |
Statements
Estimating optimal objective values for the TSP, VRP, and other combinatorial problems using randomization (English)
0 references
30 April 2024
0 references
combinatorial optimization
0 references
traveling salesman problem
0 references
vehicle routing problem
0 references
regression
0 references
0 references
0 references
