Complex-demand scheduling problem with application in smart grid (Q1727389): Difference between revisions

← Older edit Newer edit →

@@ aliases / en / 0 / aliases / en / 0 @@
+Complex-Demand Scheduling Problem with Application in Smart Grid
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6622054
@@ Property / title @@
+Complex-Demand Scheduling Problem with Application in Smart Grid (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.90097
@@ Property / zbMATH Open document ID: 1479.90097 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-319-42634-1_40
@@ Property / DOI: 10.1007/978-3-319-42634-1_40 / rank @@
+Normal rank
@@ Property / author @@
+Khaled M. Elbassioni
@@ Property / author: Khaled M. Elbassioni / rank @@
+Normal rank
@@ Property / author @@
+Chi Kin Chau
@@ Property / author: Chi Kin Chau / rank @@
+Normal rank
@@ Property / published in @@
+Lecture Notes in Computer Science
@@ Property / published in: Lecture Notes in Computer Science / rank @@
+Normal rank
@@ Property / publication date @@
+September 2016Timestamp +2016-09-02T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2016-09-02T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 2 September 2016 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6622054
@@ Property / zbMATH DE Number: 6622054 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2293456235
@@ Property / OpenAlex ID: W2293456235 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2962947575
@@ Property / OpenAlex ID: W2962947575 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.01786
@@ Property / arXiv ID: 1603.01786 / rank @@
+Normal rank
@@ Property / cites work @@
+A quasi-PTAS for unsplittable flow on line graphs
@@ Property / cites work: A quasi-PTAS for unsplittable flow on line graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Algorithms for Resource Allocation under Varying Capacity
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the unsplittable flow problem
+Normal rank
@@ Property / cites work @@
+Multicommodity demand flow in a tree and packing integer programs
+Normal rank
@@ Property / cites work @@
+Resource allocation with time intervals
@@ Property / cites work: Resource allocation with time intervals / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees
+Normal rank
@@ Property / cites work @@
+Approximation Schemes for Multi-objective Optimization with Quadratic Constraints of Fixed CP-Rank
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows
+Normal rank
@@ Property / cites work @@
+Complex-demand scheduling problem with application in smart grid
+Normal rank
@@ Property / cites work @@
+Interior-point methods for optimization
@@ Property / cites work: Interior-point methods for optimization / rank @@
+Normal rank
@@ Property / cites work @@
+On the approximability of an interval scheduling problem
+Normal rank
@@ Property / cites work @@
+When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
+Normal rank
@@ Property / cites work @@
+Optimal Power Flow With Inelastic Demands for Demand Response in Radial Distribution Networks
+Normal rank
@@ Property / cites work @@
+A Mazing 2+<i>∊</i> Approximation for Unsplittable Flow on a Path
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions
+Normal rank
@@ Property / cites work @@
+Vector Bin Packing with Multiple-Choice
@@ Property / cites work: Vector Bin Packing with Multiple-Choice / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+A unified approach to approximating resource allocation and scheduling
+Normal rank
@@ Property / cites work @@
+THE MULTIPLE-CHOICE KNAPSACK PROBLEM
@@ Property / cites work: THE MULTIPLE-CHOICE KNAPSACK PROBLEM / rank @@
+Normal rank
@@ Property / cites work @@
+Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path
+Normal rank

Revision as of 07:53, 18 July 2024

scientific article; zbMATH DE number 6622054

Complex-Demand Scheduling Problem with Application in Smart Grid

Language	Label	Description	Also known as
English	Complex-demand scheduling problem with application in smart grid	scientific article; zbMATH DE number 6622054	Complex-Demand Scheduling Problem with Application in Smart Grid