Upper and lower bounding procedures for the minimum caterpillar spanning problem (Q2840519): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: TSPLIB / rank | |||
Normal rank | |||
Revision as of 04:09, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper and lower bounding procedures for the minimum caterpillar spanning problem |
scientific article |
Statements
Upper and lower bounding procedures for the minimum caterpillar spanning problem (English)
0 references
19 July 2013
0 references
caterpillar trees
0 references
combinatorial optimization
0 references
integer programming
0 references
