A Branch Decomposition Algorithm for the p-Median Problem

DOI10.1287/ijoc.2016.0743zbMath1386.90071OpenAlexW2624794064MaRDI QIDQ4599316

Illya V. Hicks, Caleb C. Fast

Publication date: 29 December 2017

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2016.0743

zbMATH Keywords

dynamic programmingfacility location\(p\)-medianbranch decomposition

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (3)

An exact column-generation approach for the lot-type design problem ⋮ A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks ⋮ Mathematical Models and Search Algorithms for the Capacitated p-Center Problem

Cites Work

• Unnamed Item
• Computational study of large-scale \(p\)-median problems
• A note on solving large p-median problems
• Graph minors. X: Obstructions to tree-decomposition
• An efficient tabu search procedure for the \(p\)-median problem
• A dynamic programming heuristic for the \(P\)-median problem
• An aggregation heuristic for large scale p-median problem
• Greedy randomized adaptive search procedures
• A hybrid heuristic for the \(p\)-median problem
• A tighter formulation of the \(p\)-median problem
• Approximating $k$-Median via Pseudo-Approximation
• Tour Merging via Branch-Decomposition
• Solving Large p-Median Problems with a Radius Formulation
• TSPLIB—A Traveling Salesman Problem Library
• Branch decompositions and minor containment
• Local Search Heuristics for k-Median and Facility Location Problems
• On the \(p\)-median polytope

This page was built for publication: A Branch Decomposition Algorithm for the p-Median Problem