Branch and peg algorithms for the simple plant location problem.

DOI10.1016/S0305-0548(02)00049-7zbMath1039.90027OpenAlexW2088738341MaRDI QIDQ1423442

Diptesh Ghosh, Gerard Sierksma, Boris I. Goldengorin

Publication date: 14 February 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00049-7

zbMATH Keywords

Branch and boundfunctionPreprocessingPseudo-Boolean representationSimple plant location problemBeresnevPegging

Mathematics Subject Classification ID

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

Related Items (9)

Logistics distribution centers location problem and algorithm under fuzzy environment ⋮ Data aggregation for \(p\)-median problems ⋮ An exact cooperative method for the uncapacitated facility location problem ⋮ Berge-acyclic multilinear 0-1 optimization problems ⋮ Fast bounding procedures for large instances of the simple plant location problem ⋮ Branch and peg algorithms for the simple plant location problem ⋮ Facility location models for distribution system design ⋮ Exact Solution of Two Location Problems via Branch-and-Bound ⋮ Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing

Uses Software

• OR-Library

Cites Work

• Solving the simple plant location problem using a data correcting approach
• Lagrangean heuristics for location problems
• The Discrete Two-Dimensional Assortment Problem
• The Assortment Problem with Nonlinear Cost Functions
• The Plant Location Problem: New Models and Research Prospects
• Specially Structured Uncapacitated Facility Location Problems
• The Data-Correcting Algorithm for the Minimization of Supermodular Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Branch and peg algorithms for the simple plant location problem.