A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem (Q602676): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: TSPLIB / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2010.05.025 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2055044850 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 20:02, 19 March 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
