Branch and peg algorithms for the simple plant location problem

DOI10.1016/S0305-0548(02)00190-9zbMath1087.90039OpenAlexW2599964601MaRDI QIDQ1765536

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

location problemcombinatorial optimizationbranch and bound

Mathematics Subject Classification ID

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

Related Items (6)

A strengthened formulation for the simple plant location problem with order ⋮ 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 ⋮ 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

Uses Software

• iNEOS
• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving the simple plant location problem using a data correcting approach
• Branch and peg algorithms for the simple plant location problem.
• 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

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