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

DOI10.1007/BF01068765zbMath0559.90027MaRDI QIDQ5184643

I. V. Romanovskii, I. M. Davydova

Publication date: 1983

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

computer experimentsbranch-and-bound methodimprovement of fathoming boundslocation of multicommodity productionreducing the enumeration of alternatives

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Nonserial dynamic programming

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