Solving the simple plant location problem using a data correcting approach

DOI10.1023/A:1022503826877zbMath1046.90034OpenAlexW2161520725MaRDI QIDQ1411330

Gerard Sierksma, Gert A. Tijssen, Diptesh Ghosh, Boris I. Goldengorin

Publication date: 27 October 2003

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022503826877

zbMATH Keywords

Branch and boundHammer functionPreprocessingPseudo-Boolean representationSimple plant location problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

Related Items (10)

Complexity evaluation of benchmark instances for the \(p\)-median problem ⋮ Branch and peg algorithms for the simple plant location problem. ⋮ Data aggregation for \(p\)-median problems ⋮ An exact cooperative method for the uncapacitated facility location problem ⋮ Fast bounding procedures for large instances of the simple plant location problem ⋮ Branch and peg algorithms for the simple plant location problem ⋮ Equivalent instances of the simple plant location problem ⋮ An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem ⋮ Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach ⋮ Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing

Uses Software

• OR-Library

This page was built for publication: Solving the simple plant location problem using a data correcting approach