A dual ascent procedure for the exact formulation of the simple plant location problem with spatial interaction

DOI10.1080/02331939608844172MaRDI QIDQ4893705zbMATH OpenOpenAlexFDO

Authors Kaj Holmberg, Kurt Jörnsten

Publication date 18 September 1996

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331939608844172

zbMATH Keywords

dual ascent and adjustment procedureplant locationspatial interactionuncapacitated facility location

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Integer programming (90C10)

Recommendations

• Dual search procedures for the exact formulation of the simple plant location problem with spatial interaction
• A Lagrangean dual ascent algorithm for simple plant location problems
• On the exact solution of large-scale simple plant location problems
• scientific article; zbMATH DE number 4010185
• Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems

Cites work

• A Dual-Based Procedure for Uncapacitated Facility Location
• scientific article; zbMATH DE number 3727991 (Why is no real title available?)

Cited in

(7)

• Exact solution methods for uncapacitated location problems with convex transportation costs
• scientific article; zbMATH DE number 4010185 (Why is no real title available?)
• Dual search procedures for the exact formulation of the simple plant location problem with spatial interaction
• scientific article; zbMATH DE number 1264408 (Why is no real title available?)
• Technical Note—On the Equivalence of Dual Methods for Two Location Problems
• A note on duality gap in the simple plant location problem
• A Lagrangean dual ascent algorithm for simple plant location problems

This page was built for publication: A dual ascent procedure 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 Q4893705)