A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disopt.2014.08.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2039810275 / rank | |||
Normal rank | |||
Revision as of 00:51, 20 March 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
