A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing) (Q4697307)
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 Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing) |
scientific article; zbMATH DE number 221875
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing) |
scientific article; zbMATH DE number 221875 |
Statements
A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing) (English)
0 references
29 June 1993
0 references
traveling salesman
0 references
feasible minimum cost Hamiltonian path
0 references
precedence constraints
0 references
branch-and-cut algorithms
0 references
0.8226027488708496
0 references
0.8133289217948914
0 references
0.8054478764533997
0 references
0.8018075823783875
0 references
0.8014656901359558
0 references
