Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding

DOI10.1007/s10479-013-1330-7zbMath1303.90115OpenAlexW1988722832WikidataQ59398935 ScholiaQ59398935MaRDI QIDQ490221

Maciej Drwal, Jerzy Józefczyk

Publication date: 22 January 2015

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-013-1330-7

zbMATH Keywords

location theoryinteger programmingnetwork optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Integer programming (90C10) Quadratic programming (90C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Designing cost-effective content distribution networks
• Exact algorithms for the joint object placement and request routing problem in content distribution networks
• An integer programming model for the allocation of databases in a distributed computer system
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Configuration of fully replicated distributed database system over wide area networks
• Location science research: a review
• Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
• The Design of Approximation Algorithms
• Rate control for communication networks: shadow prices, proportional fairness and stability
• Approximation Algorithms for Data Placement Problems
• Competitive On-Line Algorithms for Distributed Data Management
• The facility location problem with general cost functions
• Linear programming without the matrix
• Selfish caching in distributed systems
• Fully Distributed Algorithms for Convex Optimization Problems
• Algorithms - ESA 2003
• Encyclopedia of Algorithms

This page was built for publication: Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding