A branch and efficiency algorithm for the optimal design of supply chain networks (Q2399338)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A branch and efficiency algorithm for the optimal design of supply chain networks |
scientific article; zbMATH DE number 6763472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and efficiency algorithm for the optimal design of supply chain networks |
scientific article; zbMATH DE number 6763472 |
Statements
A branch and efficiency algorithm for the optimal design of supply chain networks (English)
0 references
22 August 2017
0 references
integer programming
0 references
branch and bound
0 references
DEA
0 references
supply chain management
0 references
mixed integer linear programming (MILP)
0 references
0 references
0 references
0.810538113117218
0 references
0.7343238592147827
0 references
0.7276089191436768
0 references
0.7125406861305237
0 references
0.7069584131240845
0 references
