Scheduling for electricity cost in smart grid
From MaRDI portal
Publication:2867129
Recommendations
- Scheduling for electricity cost in a smart grid
- Online scheduling for electricity cost in smart grid
- Optimal nonpreemptive scheduling in a smart grid model
- Non-preemptive scheduling in a smart grid model and its implications on machine minimization
- Competitive algorithms for demand response management in smart grid
Cites work
- scientific article; zbMATH DE number 1306870 (Why is no real title available?)
- A polynomial algorithm for minimum quadratic cost flow problems
- Convex separable optimization is not much harder than linear optimization
- New polynomial-time cycle-canceling algorithms for minimum-cost flows
- Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
- Solving integer minimum cost flows with separable convex cost objective polynomially
- Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Cited in
(8)- Loads scheduling for demand response in energy communities
- Easy knapsacks and the complexity of energy allocation problems in the smart grid
- Asymptotically optimal scheduling of random malleable demands in smart grid
- Non-preemptive scheduling in a smart grid model and its implications on machine minimization
- Online scheduling for electricity cost in smart grid
- Optimal nonpreemptive scheduling in a smart grid model
- Competitive algorithms for demand response management in smart grid
- Scheduling for electricity cost in a smart grid
This page was built for publication: Scheduling for electricity cost in smart grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867129)