An Improved Algorithm for the Multi-Commodity Location Problem

DOI10.2307/2581262MaRDI QIDQ3893621zbMATH OpenOpenAlexFDO

Authors Alan W. Neebe, Basheer M. Khumawala

Publication date 1981

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2581262

zbMATH Keywords

branch and bound algorithmcomputational resultsfacility locationimproved algorithmimproved boundsintermediate facilitieslogisticsmulti-commodity location

Mathematics Subject Classification ID

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

Cited in

(5)

• A tree search algorithm for the multi-commodity location problem
• Facility location models for distribution planning
• A continuous model for production-distribution system design
• An algorithm for the capacitated, multi-commodity multi-period facility location problem.
• The plant location and flexible technology acquisition problem.

This page was built for publication: An Improved Algorithm for the Multi-Commodity Location Problem

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