A Note on Warszawski's Multi-Commodity Location Problem

1 February 1978

journal article
Published by Taylor & Francis in Journal of the Operational Research Society

Vol. 29 (2) , 171-172
https://doi.org/10.1057/jors.1978.32

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.

Keywords

ALGORITHM MORE EFFICIENT
WARSZAWSKI'S MULTI
MULTI COMMODITY LOCATION
BOUND ALGORITHM
LOCATION PROBLEM
LOWER BOUNDS

This publication has 0 references indexed in Scilit: