A simple dual ascent algorithm for the multilevel facility location problem

MaRDI QIDQ2816016zbMATH OpenFDO

Authors A. F. Bumb, Walter Kern

Publication date 1 July 2016

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065305800678?np=y

Mathematics Subject Classification ID

Approximation algorithms (68W25) Discrete location and assignment (90B80) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1833402
• scientific article; zbMATH DE number 1947043
• Improved approximation algorithms for multilevel facility location problems
• A Dual-Based Algorithm for Multiproduct Uncapacitated Facility Location
• A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem

Cited in

(5)

• An improved Lagrangian relaxation and dual ascent approach to facility location problems
• A dual RAMP algorithm for single source capacitated facility location problems
• Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
• scientific article; zbMATH DE number 1833402 (Why is no real title available?)
• The facility location problem with maximum distance constraint

This page was built for publication: A simple dual ascent algorithm for the multilevel facility location problem

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