A Branch Decomposition Algorithm for the <i>p</i>-Median Problem (Q4599316): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/ijoc.2016.0743 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2624794064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Search Heuristics for <i>k</i>-Median and Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(p\)-median polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational study of large-scale \(p\)-median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An aggregation heuristic for large scale p-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on solving large p-median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tour Merging via Branch-Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tighter formulation of the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large <i>p</i>-Median Problems with a Radius Formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4430877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch decompositions and minor containment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming heuristic for the \(P\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating $k$-Median via Pseudo-Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid heuristic for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient tabu search procedure for the \(p\)-median problem / rank
 
Normal rank

Latest revision as of 22:12, 14 July 2024

scientific article; zbMATH DE number 6821365
Language Label Description Also known as
English
A Branch Decomposition Algorithm for the <i>p</i>-Median Problem
scientific article; zbMATH DE number 6821365

    Statements

    A Branch Decomposition Algorithm for the <i>p</i>-Median Problem (English)
    0 references
    0 references
    0 references
    29 December 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    facility location
    0 references
    \(p\)-median
    0 references
    branch decomposition
    0 references
    dynamic programming
    0 references
    0 references