Publication:1727389

DOI10.1016/j.tcs.2018.08.023zbMath1417.90078arXiv1603.01786OpenAlexW2293456235WikidataQ128995188 ScholiaQ128995188MaRDI QIDQ1727389

Majid Khonji, Areg Karapetyan, Sid Chi-Kin Chau, Khaled M. Elbassioni, Chi Kin Chau

Publication date: 20 February 2019

Published in: Theoretical Computer Science, Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.01786

zbMATH Keywords

algorithmsschedulingknapsackunsplittable flowsmart grid

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (4)

Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions ⋮ Approximations for generalized unsplittable flow on paths with application to power systems optimization ⋮ Complex-demand scheduling problem with application in smart grid ⋮ Approximation schemes for \(r\)-weighted minimization knapsack problems

Cites Work

• Unnamed Item
• Resource allocation with time intervals
• Approximation algorithms for the unsplittable flow problem
• Geometric algorithms and combinatorial optimization
• Complex-demand scheduling problem with application in smart grid
• On the approximability of an interval scheduling problem
• Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions
• Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows
• Improved Algorithms for Resource Allocation under Varying Capacity
• A quasi-PTAS for unsplittable flow on line graphs
• Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees
• Approximation Schemes for Multi-objective Optimization with Quadratic Constraints of Fixed CP-Rank
• Vector Bin Packing with Multiple-Choice
• Multicommodity demand flow in a tree and packing integer programs
• Interior-point methods for optimization
• THE MULTIPLE-CHOICE KNAPSACK PROBLEM
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
• Optimal Power Flow With Inelastic Demands for Demand Response in Radial Distribution Networks
• Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path
• A Mazing 2+∊ Approximation for Unsplittable Flow on a Path
• A unified approach to approximating resource allocation and scheduling

This page was built for publication: Complex-demand scheduling problem with application in smart grid