Branch and peg algorithms for the simple plant location problem.

DOI10.1016/S0305-0548(02)00049-7MaRDI QIDQ1423442zbMATH OpenOpenAlexFDO

Authors Diptesh Ghosh, Gerard Sierksma, Boris 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

BeresnevBranch and boundfunctionPeggingPreprocessingPseudo-Boolean representationSimple plant location problem

Mathematics Subject Classification ID

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

Recommendations

• Branch and peg algorithms for the simple plant location problem
• scientific article; zbMATH DE number 1848396
• On the exact solution of large-scale simple plant location problems
• scientific article; zbMATH DE number 4010185
• Fast bounding procedures for large instances of the simple plant location problem

Cites work

• scientific article; zbMATH DE number 4202014 (Why is no real title available?)
• scientific article; zbMATH DE number 4039675 (Why is no real title available?)
• scientific article; zbMATH DE number 3503127 (Why is no real title available?)
• scientific article; zbMATH DE number 1310285 (Why is no real title available?)
• scientific article; zbMATH DE number 3378707 (Why is no real title available?)
• Lagrangean heuristics for location problems
• Solving the simple plant location problem using a data correcting approach
• Specially Structured Uncapacitated Facility Location Problems
• The Assortment Problem with Nonlinear Cost Functions
• The Data-Correcting Algorithm for the Minimization of Supermodular Functions
• The Discrete Two-Dimensional Assortment Problem
• The Plant Location Problem: New Models and Research Prospects

Cited in

(11)

• Fast bounding procedures for large instances of the simple plant location problem
• Branch and peg algorithms for the simple plant location problem
• Berge-acyclic multilinear 0-1 optimization problems
• Logistics distribution centers location problem and algorithm under fuzzy environment
• Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
• scientific article; zbMATH DE number 1848396 (Why is no real title available?)
• Data aggregation for \(p\)-median problems
• An exact cooperative method for the uncapacitated facility location problem
• Exact solution of two location problems via branch-and-bound
• Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences
• Facility location models for distribution system design

Describes a project that uses

Uses Software

• OR-Library

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1423442)