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

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

Latest revision as of 08: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

Statements

Complex-demand scheduling problem with application in smart grid (English)
0 references
Complex-Demand Scheduling Problem with Application in Smart Grid (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
20 February 2019
0 references
2 September 2016
0 references
0 references
0 references
0 references
0 references
0 references
algorithms
0 references
scheduling
0 references
smart grid
0 references
unsplittable flow
0 references
knapsack
0 references
0 references
0 references
0 references
0 references