On solving large instances of the capacitated facility location problem

DOI10.1016/j.ejor.2006.01.035zbMath1163.90614OpenAlexW2069373837MaRDI QIDQ859676

Jayaram K. Sankaran

Publication date: 16 January 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.01.035

zbMATH Keywords

integer programmingfacilities planning and designpolyhedral approachescustomer aggregationvariable-upper-bounds

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Related Items (2)

The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches ⋮ A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem

Uses Software

• LINDO
• MINTO
• LINGO

Cites Work

• Unnamed Item
• On worst-case aggregation analysis for network location problems
• Valid inequalities and facets of the capacitated plant location problem
• Capacitated facility location: Separation algorithms and computational experience
• MINTO, a Mixed INTeger Optimizer
• Polyhedral analysis and decompositions for capacitated plant location-type problems
• Error-bound driven demand point aggregation for the rectilinear distance p-center model
• Capacitated Facility Location: Valid Inequalities and Facets
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Row-Column Aggregation for Rectilinear Distance p-Median Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: On solving large instances of the capacitated facility location problem