A tree search algorithm for the multi-commodity location problem

DOI10.1016/0377-2217(85)90007-4zbMath0565.90012OpenAlexW1985421223MaRDI QIDQ1058962

Richard S. Laundy

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90007-4

zbMATH Keywords

Lagrangean relaxationboundstree search algorithmdual heuristicmulti-commodity location problem

Mathematics Subject Classification ID

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

Related Items (2)

A method for solving to optimality uncapacitated location problems ⋮ Heuristic methods and applications: A categorized survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A cost operator approach to multistage location-allocation
• A Dual-Based Procedure for Uncapacitated Facility Location
• An Improved Algorithm for the Multi-Commodity Location Problem
• The Multi-Commodity Facilities Location Problem
• Multicommodity Distribution System Design by Benders Decomposition
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• An analysis of approximations for maximizing submodular set functions—I
• Validation of subgradient optimization
• An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
• Multi-Dimensional Location Problems

This page was built for publication: A tree search algorithm for the multi-commodity location problem