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

DOI10.1080/02331939608844172zbMATH Open0854.90090OpenAlexW2084193097MaRDI QIDQ4893705FDOQ4893705

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

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

zbMATH Keywords

spatial interactionplant locationuncapacitated facility locationdual ascent and adjustment procedure

Mathematics Subject Classification ID

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

Cites Work

• A Dual-Based Procedure for Uncapacitated Facility Location
• Title not available (Why is that?)

Cited In (5)

• Title not available (Why is that?)
• A note on duality gap in the simple plant location problem
• A Lagrangean dual ascent algorithm for simple plant location problems
• Exact solution methods for uncapacitated location problems with convex transportation costs
• Title not available (Why is that?)

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)