Finding the largest suborder of fixed width (Q687176): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing setups in ordered sets of fixed width / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A decomposition theorem for partially ordered sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing the number of tardy jobs in single machine sequencing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal Sequencing by Modular Decomposition: Polynomial Algorithms / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf00420355 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2010610650 / rank | |||
Normal rank | |||
Latest revision as of 12:01, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the largest suborder of fixed width |
scientific article |
Statements
Finding the largest suborder of fixed width (English)
0 references
17 October 1993
0 references
largest suborder of fixed width
0 references
combinatorial optimization
0 references
scheduling
0 references
polynomial time
0 references
minimum cost network flow problem
0 references
