A recognition problem in converting linear programming to network flow models (Q1309143): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Yanpei Liu / rank | |||
Property / author | |||
Property / author: Yanpei Liu / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Converting Linear Programs to Network Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The practical conversion of linear programmes to network flow models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Testing of a large-scale network optimization program / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3292914 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3048571 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Packing Problems and Hypergraph Theory: A Survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4732117 / rank | |||
Normal rank |
Latest revision as of 11:58, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A recognition problem in converting linear programming to network flow models |
scientific article |
Statements
A recognition problem in converting linear programming to network flow models (English)
0 references
28 February 1994
0 references
polygon-matrix
0 references
sequencing
0 references
tree
0 references
induced subgraph
0 references