Dual search procedures for the exact formulation of the simple plant location problem with spatial interaction

DOI10.1016/S0966-8349(96)00013-7zbMath0927.90068OpenAlexW2001301908MaRDI QIDQ4228754

Kaj Holmberg, Kurt O. Jørnsten

Publication date: 1 March 1999

Published in: Location Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0966-8349(96)00013-7

zbMATH Keywords

mixed integer programmingseparable programminglocationdual ascentspatial interactionspatial gravity model

Mathematics Subject Classification ID

Mixed integer programming (90C11) Discrete location and assignment (90B80)

Related Items (3)

Dynamic supply chain design with inventory ⋮ Exact solution methods for uncapacitated location problems with convex transportation costs ⋮ A multiperiod two-echelon multicommodity capacitated plant location problem

This page was built for publication: Dual search procedures for the exact formulation of the simple plant location problem with spatial interaction