Scheduling for Electricity Cost in Smart Grid

DOI10.1007/978-3-319-03780-6_27zbMath1407.90142OpenAlexW2296617314MaRDI QIDQ2867129

Wing-Kai Hon, Prudence W. H. Wong, Hsiang-Hsuan Liu, David K. Y. Yau, Mihai Burcea

Publication date: 10 December 2013

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03780-6_27

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Scheduling for electricity cost in a smart grid ⋮ Online Scheduling for Electricity Cost in Smart Grid ⋮ Easy knapsacks and the complexity of energy allocation problems in the smart grid

Cites Work

• Unnamed Item
• A polynomial algorithm for minimum quadratic cost flow problems
• Solving integer minimum cost flows with separable convex cost objective polynomially
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
• New polynomial-time cycle-canceling algorithms for minimum-cost flows
• Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
• Convex separable optimization is not much harder than linear optimization

This page was built for publication: Scheduling for Electricity Cost in Smart Grid