A note on a generalized network flow model for manufacturing process (Q1036893): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10255-005-5157-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2027420053 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3056948 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4872059 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Manufacturing network flows: a generalized network flow model for manufacturing process modelling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3048571 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the simplex algorithm for networks and generalized networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A polynomial time primal network simplex algorithm for minimum cost flows / rank | |||
Normal rank | |||
Latest revision as of 03:48, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on a generalized network flow model for manufacturing process |
scientific article |
Statements
A note on a generalized network flow model for manufacturing process (English)
0 references
13 November 2009
0 references
minimum cost network flow
0 references
network simplex method
0 references
initial basic feasible solution
0 references
partially ordered set
0 references
extended cycle
0 references
0 references
