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

DOI10.1016/S0966-8349(96)00013-7zbMATH Open0927.90068OpenAlexW2001301908MaRDI QIDQ4228754FDOQ4228754

Authors: Kaj Holmberg, Kurt 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

Recommendations

• A dual ascent procedure for the exact formulation of the simple plant location problem with spatial interaction
• On the exact solution of large-scale simple plant location problems
• scientific article; zbMATH DE number 4010185
• A Lagrangean dual ascent algorithm for simple plant location problems
• Exact solution methods for uncapacitated location problems with convex transportation costs

zbMATH Keywords

locationmixed integer programmingspatial interactionseparable programmingdual ascentspatial gravity model

Mathematics Subject Classification ID

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

Cited In (5)

• An interactive procedure dedicated to a bicriteria plant location model.
• Title not available (Why is that?)
• Exact solution methods for uncapacitated location problems with convex transportation costs
• A multiperiod two-echelon multicommodity capacitated plant location problem
• Dynamic supply chain design with inventory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228754)