The prize collecting traveling salesman problem (Q3832349): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4174517 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5187226 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the symmetric travelling salesman problem: A computational study / rank | |||
Normal rank | |||
Latest revision as of 09:00, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The prize collecting traveling salesman problem |
scientific article |
Statements
The prize collecting traveling salesman problem (English)
0 references
1989
0 references
scheduling
0 references
routing problems
0 references
Prize Collecting Traveling Salesman Problem
0 references
polytope
0 references
facet defining inequalities
0 references
knapsack polytope
0 references
cutting planes
0 references
