The many-commodity location problem (the branch-and-bound method)

DOI10.1007/BF01068765MaRDI QIDQ5184643zbMATH OpenFDO

Authors I. M. Davydova, I. V. Romanovskii

Publication date 1983

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01068765

zbMATH Keywords

branch-and-bound methodcomputer experimentsimprovement of fathoming boundslocation of multicommodity productionreducing the enumeration of alternatives

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05)

Recommendations

• A branch-and-bound method for multicommodity location with balancing requirements
• scientific article; zbMATH DE number 711782
• A tree search algorithm for the multi-commodity location problem
• Parallel Implementations Of A Branch-And-Bound Algorithm For Multicommodity Location With Balancing Requirements
• A branch-and-bound algorithm for the multi-level uncapacitated facility location problem

Cites work

• scientific article; zbMATH DE number 3932791 (Why is no real title available?)
• Nonserial dynamic programming

Cited in

(6)

• A tree search algorithm for the multi-commodity location problem
• A branch-and-bound method for multicommodity location with balancing requirements
• scientific article; zbMATH DE number 4016553 (Why is no real title available?)
• The Multi-Commodity Source Location Problems and the Price of Greed
• scientific article; zbMATH DE number 3915985 (Why is no real title available?)
• Exact solution of two location problems via branch-and-bound

This page was built for publication: The many-commodity location problem (the branch-and-bound method)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5184643)