New approximation algorithms for the unsplittable capacitated facility location problem (Q300454): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A 3-Approximation for Facility Location with Uniform Capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search heuristic for k-median and facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 5-Approximation for Capacitated Facility Location / 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: An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing can be solved within 1+epsilon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532026 / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250234 / 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: Q4250157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4203976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank

Latest revision as of 05:31, 12 July 2024

scientific article
Language Label Description Also known as
English
New approximation algorithms for the unsplittable capacitated facility location problem
scientific article

    Statements

    New approximation algorithms for the unsplittable capacitated facility location problem (English)
    0 references
    0 references
    0 references
    0 references
    28 June 2016
    0 references
    approximation algorithms
    0 references
    capacitated facility location
    0 references
    hard capacities
    0 references

    Identifiers