Solving the traveling salesman problem with interdiction and fortification (Q1728213)
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: Solving the traveling salesman problem with interdiction and fortification |
scientific article; zbMATH DE number 7027692
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the traveling salesman problem with interdiction and fortification |
scientific article; zbMATH DE number 7027692 |
Statements
Solving the traveling salesman problem with interdiction and fortification (English)
0 references
22 February 2019
0 references
interdiction
0 references
integer programming
0 references
traveling salesman problem
0 references
0.8343895673751831
0 references
0.7629321813583374
0 references
0.7407127618789673
0 references
0.7343901991844177
0 references
0.7297470569610596
0 references
