A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem (Q3637400): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: ABACUS / rank | |||
Normal rank | |||
Revision as of 01:41, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem |
scientific article |
Statements
A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem (English)
0 references
9 July 2009
0 references
