Dynamic mean value cross decomposition algorithm for capacitated facility location problems

zbMATH Open1316.90017MaRDI QIDQ5262420FDOQ5262420

Sung-Seok Ko, Gyunghyun Choi, Chulyeon Kim

Publication date: 15 July 2015

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

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

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)

Cited In (1)

• Title not available (Why is that?)

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)