New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem (Q537638): 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.1007/s11590-010-0205-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2034550441 / rank | |||
Normal rank | |||
Revision as of 21:56, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem |
scientific article |
Statements
New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem (English)
0 references
20 May 2011
0 references
high multiplicity asymmetric traveling salesman problem
0 references
polynomial-length formulation
0 references
Chesapeake problem
0 references
parallel machine scheduling
0 references
lot-sizing
0 references
