A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem (Q602676)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem |
scientific article; zbMATH DE number 5810755
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem |
scientific article; zbMATH DE number 5810755 |
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
0.8761462569236755
0 references
0.8737063407897949
0 references
0.7882281541824341
0 references
0.7843004465103149
0 references
0.7661670446395874
0 references
