Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (Q490221): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59398935, #quickstatements; #temporary_batch_1708296850199
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10479-013-1330-7 / rank
Normal rank
 
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.1007/s10479-013-1330-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988722832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Data Placement Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing cost-effective content distribution networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the joint object placement and request routing problem in content distribution networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish caching in distributed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Configuration of fully replicated distributed database system over wide area networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The facility location problem with general cost functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location science research: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encyclopedia of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rate control for communication networks: shadow prices, proportional fairness and stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive On-Line Algorithms for Distributed Data Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Distributed Algorithms for Convex Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming without the matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer programming model for the allocation of databases in a distributed computer system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized rounding: A technique for provably good algorithms and algorithmic proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4319638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Design of Approximation Algorithms / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10479-013-1330-7 / rank
 
Normal rank

Latest revision as of 19:10, 9 December 2024

scientific article
Language Label Description Also known as
English
Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding
scientific article

    Statements

    Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (English)
    0 references
    0 references
    0 references
    22 January 2015
    0 references
    location theory
    0 references
    network optimization
    0 references
    integer programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references