A tree search algorithm for the multi-commodity location problem
From MaRDI portal
Publication:1058962
DOI10.1016/0377-2217(85)90007-4zbMATH Open0565.90012OpenAlexW1985421223MaRDI QIDQ1058962FDOQ1058962
Authors: Richard 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
Recommendations
- The many-commodity location problem (the branch-and-bound method)
- Lower and upper bounds for a capacitated plant location problem with multicommodity flow
- A multiperiod two-echelon multicommodity capacitated plant location problem
- A branch-and-bound method for multicommodity location with balancing requirements
- scientific article; zbMATH DE number 4010185
Numerical mathematical programming methods (65K05) Integer programming (90C10) Inventory, storage, reservoirs (90B05)
Cites Work
- Multicommodity Distribution System Design by Benders Decomposition
- Title not available (Why is that?)
- Validation of subgradient optimization
- An analysis of approximations for maximizing submodular set functions—I
- A Dual-Based Procedure for Uncapacitated Facility Location
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Title not available (Why is that?)
- Multi-Dimensional Location Problems
- An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
- The Multi-Commodity Facilities Location Problem
- A cost operator approach to multistage location-allocation
- An Improved Algorithm for the Multi-Commodity Location Problem
- Title not available (Why is that?)
Cited In (9)
- Heuristic methods and applications: A categorized survey
- The many-commodity location problem (the branch-and-bound method)
- An effective algorithm for the two-stage location problem on a tree-like network
- Lower and upper bounds for a capacitated plant location problem with multicommodity flow
- MULTI-FACILITY LOCATION PROBLEM WITH NONINCREASING PIECEWISE LINEAR DEMAND ON A TREE
- A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements
- A method for solving to optimality uncapacitated location problems
- A branch-and-bound method for multicommodity location with balancing requirements
- A Heuristic Procedure For Path Location With Multisource Demand
This page was built for publication: A tree search 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 Q1058962)
