Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding
type: Item
instance of: scholarly article
title: Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding
zbMATH Open document ID: 1303.90115
author: Maciej Drwal
author: Jerzy Józefczyk
published in: Annals of Operations Research
publication date: 2015-01-22T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 6389172
zbMATH Keywords: location theory
zbMATH Keywords: network optimization
zbMATH Keywords: integer programming
Wikidata QID: Q59398935
MaRDI profile type: Publication
full work available at URL: s10479-013-1330-7
OpenAlex ID: W1988722832
cites work: Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
cites work: Approximation algorithms for data placement in arbitrary networks
cites work: Approximation Algorithms for Data Placement Problems
cites work: Q4633893
cites work: Designing cost-effective content distribution networks
cites work: Exact algorithms for the joint object placement and request routing problem in content distribution networks
cites work: Selfish caching in distributed systems
cites work: Configuration of fully replicated distributed database system over wide area networks
cites work: The facility location problem with general cost functions
cites work: Location science research: a review
cites work: Encyclopedia of Algorithms
cites work: Q4821303
cites work: Rate control for communication networks: shadow prices, proportional fairness and stability
cites work: Q4252337
cites work: Competitive On-Line Algorithms for Distributed Data Management
cites work: Algorithms - ESA 2003
cites work: Fully Distributed Algorithms for Convex Optimization Problems
cites work: Linear programming without the matrix
cites work: An integer programming model for the allocation of databases in a distributed computer system
cites work: Randomized rounding: A technique for provably good algorithms and algorithmic proofs
cites work: Q4319638
cites work: The Design of Approximation Algorithms
DOI: 10.1007/S10479-013-1330-7
description: scientific article; zbMATH DE number 6389172