Observations on some heuristic methods for the capacitated facility location problem

DOI10.1007/S12597-012-0064-7zbMath1353.90183OpenAlexW2027571215MaRDI QIDQ505112

Pritibhushan Sinha

Publication date: 19 January 2017

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-012-0064-7

zbMATH Keywords

heuristicsproblem instancescapacitated facility location problem

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (1)

A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem

Cites Work

• Unnamed Item
• A heuristic lagrangean algorithm for the capacitated plant location problem
• A comparison of heuristics and relaxations for the capacitated plant location problem
• An effective heuristic for large-scale capacitated facility location problems
• Heuristics for the capacitated plant location model
• ADD-heuristics' starting procedures for capacitated plant location models
• Near-optimal solutions to large-scale facility location problems
• Lagrangean heuristics for location problems
• Analysis of a Local Search Heuristic for Facility Location Problems

This page was built for publication: Observations on some heuristic methods for the capacitated facility location problem