Solving Optimization Problems with Diseconomies of Scale via Decoupling
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 569532
- scientific article; zbMATH DE number 833651
- scientific article; zbMATH DE number 764391
- Solving oligopolistic equilibrium problems with convex optimization
- Scaling features in complex optimization problems
- Computation of a large-scale competitive equilibrium through optimization
- scientific article; zbMATH DE number 679873
- Decomposition for solutions of large-scale multicriteria problems
- Cost distributions in large combinatorial optimisation problems
- Optimization of an Economic System Using Nonlinear Decomposition
Cited in
(13)- Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion
- Bayesian generalized network design
- Decoupling Coupled Constraints Through Utility Design
- Simpler and Better Algorithms for Minimum-Norm Load Balancing
- Bayesian generalized network design
- scientific article; zbMATH DE number 7765403 (Why is no real title available?)
- The price of independence in a model with unknown dependence
- Cluster before you hallucinate: node-capacitated network design and energy efficient routing
- Minimum-norm load balancing Is (almost) as easy as minimizing makespan
- Fair interventions in weighted congestion games
- Sharp decoupling inequalities for the variances and second moments of sums of dependent random variables
- Optimal competitive ratio for optimization problems with congestion effects
- Randomized oblivious integral routing for minimizing power cost
This page was built for publication: Solving Optimization Problems with Diseconomies of Scale via Decoupling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4625663)
