Technical Note—A Branch-and-Bound Algorithm for Seeking the P-Median

DOI10.1287/OPRE.20.1.173zbMath0232.90035OpenAlexW2014282911MaRDI QIDQ5641004

Pertti Järvinen, Heikki Sinervo, Jaakko Rajala

Publication date: 1972

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.20.1.173

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (14)

The linking set problem: a polynomial special case of the multiple-choice knapsack problem ⋮ A double annealing algorithm for discrete location/allocation problems ⋮ Developments in network location with mobile and congested facilities ⋮ A graph theoretical bound for the p-median problem ⋮ Budget constrained location problem with opening and closing of facilities. ⋮ A method for solving to optimality uncapacitated location problems ⋮ Fast primal and dual heuristics for the \(p\)-median location problem ⋮ The minimum weight \(t\)-composition of an integer ⋮ A family of facets for the uncapacitated \(p\)-median polytope ⋮ Affinity propagation and uncapacitated facility location problems ⋮ On cutting planes for cardinality-constrained linear programs ⋮ Unnamed Item ⋮ A comparison of two dual-based procedures for solving the p-median problem ⋮ Solving capacitated clustering problems

This page was built for publication: Technical Note—A Branch-and-Bound Algorithm for Seeking the P-Median