A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem (Q602676): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2010.05.025 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2010.05.025 / rank | |||
Normal rank | |||
Latest revision as of 21:57, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem |
scientific article |
Statements
A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem (English)
0 references
5 November 2010
0 references
swapping problem
0 references
robot arm travel
0 references
non-preemptive
0 references
capacitated
0 references
mathematical programming
0 references
branch-and-cut
0 references
0 references
0 references
