Back to Search Start Over

A Note on Warszawski's Multi-Commodity Location Problem

Authors :
Alan W. Neebe
Basheer M. Khumawala
Source :
Journal of the Operational Research Society. 29:171-172
Publication Year :
1978
Publisher :
Informa UK Limited, 1978.

Abstract

This note shows two easily incorporated improvements in computing the lower bounds for Warszawski's branch and bound algorithm for the multi-commodity location problem. The lower bounds become relatively stronger, thereby making the branch and bound algorithm more efficient.

Subjects

Subjects :
Marketing
Mathematical optimization
Multi commodity
Operations research
Branch and bound
Computer science
Strategy and Management
Management Science and Operations Research
Management Information Systems
Scheduling (computing)

Details

ISSN :
14769360 and 01605682
Volume :
29
Database :
OpenAIRE
Journal :
Journal of the Operational Research Society
Accession number :
edsair.doi...........9158554ee1c9c25ca7bbcd651c7d92d5
Full Text :
https://doi.org/10.1057/jors.1978.32
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details