A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing) (Q4697307): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
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.1137/0803002 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1964651230 / rank | |||
Normal rank |
Latest revision as of 22:41, 19 March 2024
scientific article; zbMATH DE number 221875
Language | Label | Description | Also known as |
---|---|---|---|
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