Local search algorithms for the red-blue median problem (Q692631): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-011-9547-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2056895523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542527 / 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: The prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment problem in content distribution networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Combinatorial Algorithms for Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant-factor approximation algorithm for the \(k\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for capacitated facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight approximation algorithms for maximum general assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new greedy approach for facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly Linear-Time Approximation Scheme for the Euclidean <i>k</i>-Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a Local Search Heuristic for Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for geometric median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Some Common Geometric Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Average Shortest Path Distances via Shortcut Edge Addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank

Latest revision as of 23:42, 5 July 2024

scientific article
Language Label Description Also known as
English
Local search algorithms for the red-blue median problem
scientific article

    Statements

    Local search algorithms for the red-blue median problem (English)
    0 references
    0 references
    6 December 2012
    0 references
    0 references
    facility location
    0 references
    \(k\)-median
    0 references
    prize-collecting
    0 references
    local search algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references