An algorithm for finding the optimum solution of solid fixed-charge transportation problem (Q4764850): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Use of penalties in a branch and bound procedure for the fixed charge transportation problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Branch-and-Bound Method for the Fixed Charge Transportation Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A vertex ranking algorithm for the fixed-charge transportation problem / rank | |||
Normal rank | |||
Latest revision as of 12:09, 23 May 2024
scientific article; zbMATH DE number 746302
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for finding the optimum solution of solid fixed-charge transportation problem |
scientific article; zbMATH DE number 746302 |
Statements
An algorithm for finding the optimum solution of solid fixed-charge transportation problem (English)
0 references
5 September 1995
0 references
solid fixed-charge transportation problem
0 references
0 references
