Branch and bound algorithm for the warehouse location problem with the objective function as linear fractional

DOI10.1007/BF03398757zbMath1153.90479MaRDI QIDQ998681

Sudha Arora, Sant R. Arora

Publication date: 9 February 2009

Published in: Opsearch (Search for Journal in Brave)

zbMATH Keywords

branch and boundfractional programmingopen and closed warehouse

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Fractional programming (90C32) Discrete location and assignment (90B80)

Related Items (2)

The reverse selective balance center location problem on trees ⋮ A branch and bound algorithm for the partial coverage capacitated plant location problem

Cites Work

• Exact solution methods for uncapacitated location problems with convex transportation costs
• Algorithms for the Simple Plant-Location Problem with Some Side Conditions
• An Efficient Branch and Bound Algorithm for the Warehouse Location Problem

This page was built for publication: Branch and bound algorithm for the warehouse location problem with the objective function as linear fractional