A cutting plane algorithm for the general routing problem (Q5935711): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s101070100219 / rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: TSPLIB / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S101070100219 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:52, 9 December 2024
scientific article; zbMATH DE number 1610921
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A cutting plane algorithm for the general routing problem |
scientific article; zbMATH DE number 1610921 |
Statements
A cutting plane algorithm for the general routing problem (English)
0 references
7 August 2002
0 references
valid inequalities
0 references
cutting planes
0 references
general routing problem
0 references
rural postman problem
0 references
travelling salesman problem
0 references
