A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/disopt/JepsenPSP14, #quickstatements; #temporary_batch_1731483406851 |
||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/disopt/JepsenPSP14 / rank | |||
Normal rank |
Latest revision as of 09:01, 13 November 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
0 references
0 references
0 references
0 references
0 references
0 references