Testing the necklace condition for shortest tours and optimal factors in the plane (Q1262765)
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: Testing the necklace condition for shortest tours and optimal factors in the plane |
scientific article; zbMATH DE number 4125009
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Testing the necklace condition for shortest tours and optimal factors in the plane |
scientific article; zbMATH DE number 4125009 |
Statements
Testing the necklace condition for shortest tours and optimal factors in the plane (English)
0 references
1989
0 references
See the review in Zbl 0636.68042.
0 references
transportation problem
0 references
linear programming
0 references
combinatorial geometry
0 references
computational geometry
0 references
disks
0 references
traveling salesman tour
0 references
m-factors
0 references
intersection graphs
0 references
