The relation of time indexed formulations of single machine scheduling problems to the node packing problem (Q1396279): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10107-002-0335-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2059970089 / rank | |||
Normal rank | |||
Revision as of 20:15, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The relation of time indexed formulations of single machine scheduling problems to the node packing problem |
scientific article |
Statements
The relation of time indexed formulations of single machine scheduling problems to the node packing problem (English)
0 references
30 June 2003
0 references
nonpreemptive single machine scheduling
0 references
node packing
0 references
polyhedral methods
0 references
facet defining graphs
0 references
lifted valid inequalities
0 references
facet inducing inequalities
0 references
