Branch and peg algorithms for the simple plant location problem

DOI10.1016/S0305-0548(02)00190-9MaRDI QIDQ1765536zbMATH OpenOpenAlexFDO

Authors Diptesh Ghosh, Gerard Sierksma, Boris Goldengorin

Publication date 23 February 2005

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

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

zbMATH Keywords

combinatorial optimizationbranch and boundlocation problem

Mathematics Subject Classification ID

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

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?)
• Branch and peg algorithms for the simple plant location problem.
• 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

(9)

• New genetic algorithms based approaches to continuous \(p\)-median problem
• Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems.
• An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
• On a class of subadditive duals for the uncapacitated facility location problem
• An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
• A strengthened formulation for the simple plant location problem with order
• scientific article; zbMATH DE number 1823835 (Why is no real title available?)
• scientific article; zbMATH DE number 1848396 (Why is no real title available?)
• Branch and peg algorithms for the simple plant location problem.

Describes a project that uses

Uses Software

• OR-Library
• iNEOS

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 Q1765536)