A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
DOI10.1016/0377-2217(84)90258-3zbMath0542.90034OpenAlexW1972454391MaRDI QIDQ795714
Publication date: 1984
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(84)90258-3
location problemdistribution systemlower and upper boundslogisticsbranch-and- bounddual ascent procedureintermediate level facilitiesmulti-level uncapacitated facility location problemprimal descent procedure
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05)
Related Items (32)
Cites Work
- Unnamed Item
- A direct dual method for the mixed plant location problem with some side constraints
- A Dual-Based Procedure for Uncapacitated Facility Location
- A cost function property for plant location problems
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- A Plant and Warehouse Location Problem
- A branch‐bound algorithm for the capacitated facilities location problem
- Site Location via Mixed-integer Programming
- An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
This page was built for publication: A branch-and-bound algorithm for the multi-level uncapacitated facility location problem