Dynamic mean value cross decomposition algorithm for capacitated facility location problems

MaRDI QIDQ5262420zbMATH OpenFDO

Authors Chulyeon Kim, Gyunghyun Choi, Sung-Seok Ko

Publication date 15 July 2015

Full work available at URL http://content.iospress.com/articles/informatica/inf24-4-02

zbMATH Keywords

Lagrangian relaxationcross decompositionmean value cross decompositioncapacitated facility location problemsprimal recovery strategies

Mathematics Subject Classification ID

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

Recommendations

• A Cross Decomposition Algorithm for Capacitated Facility Location
• scientific article; zbMATH DE number 1866926
• A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
• A cross decomposition algorithm for a multiproduct-multitype facility location problem
• A branch-and-price algorithm for the capacitated facility location problem

Cited in

(1)

• scientific article; zbMATH DE number 1866926 (Why is no real title available?)

This page was built for publication: Dynamic mean value cross decomposition algorithm for capacitated facility location problems

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