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

DOI10.1287/OPRE.20.1.173MaRDI QIDQ5641004zbMATH OpenOpenAlexFDO

Authors Pertti Järvinen, Jaakko Rajala, Heikki Sinervo

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)

Cited in

(14)

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

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

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