Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation
From MaRDI portal
Publication:3115938
DOI10.1287/mnsc.1050.0410zbMath1232.90255OpenAlexW2142912132MaRDI QIDQ3115938
Publication date: 21 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10419/147622
Mixed integer programming (90C11) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (8)
A branch-and-price algorithm for the capacitated facility location problem ⋮ Dantzig-Wolfe decomposition for the facility location and production planning problem ⋮ An integrated <scp>user‐system</scp> approach for shelter location and evacuation routing ⋮ Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation ⋮ A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem ⋮ Facility location models for distribution system design ⋮ Weak flow cover inequalities for the capacitated facility location problem ⋮ A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem
Uses Software
This page was built for publication: Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation
