New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2968488): 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.1111/itor.12261 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2523296286 / rank | |||
Normal rank |
Revision as of 23:20, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks |
scientific article |
Statements
New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (English)
0 references
16 March 2017
0 references
integer programming
0 references
transportation
0 references
traveling salesman
0 references
valid inequalities
0 references