Simultaneous optimization via approximate majorization for concave profits or convex costs

DOI10.1007/s00453-005-1177-7zbMath1113.90070OpenAlexW2081269878MaRDI QIDQ2498404

Adam Meyerson, Ashish Goel

Publication date: 16 August 2006

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-005-1177-7

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Deterministic network models in operations research (90B10)

Related Items (9)

Optimal Allocation for Chunked-Reward Advertising ⋮ Fair online load balancing ⋮ Simultaneous approximation of multi-criteria submodular function maximization ⋮ Pricing for fairness: distributed resource allocation for multiple objectives ⋮ Surrogate optimization for \(p\)-norms ⋮ Simpler and Better Algorithms for Minimum-Norm Load Balancing ⋮ Fair welfare maximization ⋮ Price-based protocols for fair resource allocation ⋮ Approximate tradeoffs on weighted labeled matroids

This page was built for publication: Simultaneous optimization via approximate majorization for concave profits or convex costs