A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q58826343, #quickstatements; #temporary_batch_1712101902020 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q58826343 / rank | |||
Normal rank | |||
Revision as of 01:14, 3 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for the capacitated profitable tour problem |
scientific article |
Statements
A branch-and-cut algorithm for the capacitated profitable tour problem (English)
0 references
9 April 2015
0 references
branch-and-cut algorithm
0 references
valid inequalities
0 references
profitable tour problem
0 references
capacitated shortest path problem
0 references
traveling salesman problem
0 references
