Easy knapsacks and the complexity of energy allocation problems in the smart grid

DOI10.1007/s11590-017-1209-7zbMath1401.91222OpenAlexW2767830555WikidataQ59603592 ScholiaQ59603592MaRDI QIDQ1800444

Theo Karaboghossian, Michele Zito

Publication date: 23 October 2018

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-017-1209-7

zbMATH Keywords

optimizationcomplexitydynamic programmingsmart gridenergy allocation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Dynamic programming (90C39) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling for Electricity Cost in Smart Grid
• Primal-Dual Schema for Capacitated Covering Problems
• `` Strong NP-Completeness Results

This page was built for publication: Easy knapsacks and the complexity of energy allocation problems in the smart grid