A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
From MaRDI portal
Publication:4656678
DOI10.1057/palgrave.jors.2601353zbMath1130.90354OpenAlexW1981943371MaRDI QIDQ4656678
Publication date: 14 March 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601353
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items (22)
A bi-objective approach to discrete cost-bottleneck location problems ⋮ Fast scenario reduction by conditional scenarios in two-stage stochastic MILP problems ⋮ A compact model and tight bounds for a combined location-routing problem ⋮ A heuristic for BILP problems: the single source capacitated facility location problem ⋮ An implementation of exact knapsack separation ⋮ A cutting plane algorithm for the capacitated connected facility location problem ⋮ General network design: a unified view of combined location and network design problems ⋮ A cut-and-solve based algorithm for the single-source capacitated facility location problem ⋮ Revisiting Lagrangian relaxation for network design ⋮ Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing ⋮ A distributionally robust optimization approach for two-stage facility location problems ⋮ A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem ⋮ Locating Satellite Yards in Forestry Operations ⋮ A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem ⋮ Integrated districting, fleet composition, and inventory planning for a multi-retailer distribution system ⋮ Scatter search for the single source capacitated facility location problem ⋮ An improved cut-and-solve algorithm for the single-source capacitated facility location problem ⋮ Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem ⋮ A computational evaluation of a general branch-and-price framework for capacitated network location problems ⋮ Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach ⋮ Hybrid scatter search and path relinking for the capacitated \(p\)-median problem ⋮ Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics
This page was built for publication: A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
