Approximations for generalized unsplittable flow on paths with application to power systems optimization (Q2678593): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Khaled M. Elbassioni / rank
Normal rank
 
Property / author
 
Property / author: Khaled M. Elbassioni / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3181112546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Unsplittable Flow on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252268 / 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: A quasi-PTAS for unsplittable flow on line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logarithmic approximation for unsplittable flow on line graphs / 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: New Approximation Schemes for Unsplittable Flow on a Path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737541 / 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: Optimal Power Flow With Inelastic Demands for Demand Response in Radial Distribution Networks / 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: Caching is hard -- even in the fault model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for \(r\)-weighted minimization knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Convex Relaxation of Optimal Power Flow in Radial Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the value of a space mission / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex quadratic relaxations for mixed-integer nonlinear programs in power systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization of AC Optimal Power Flow With Discrete Demands in Radial Networks / 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: Approximation Algorithms for Single-Source Unsplittable Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Relaxation of Optimal Power Flow—Part II: Exactness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Off-line admission control for general scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized rounding: A technique for provably good algorithms and algorithmic proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Guarantees for Packing and Covering Integer Programs / rank
 
Normal rank

Latest revision as of 08:40, 31 July 2024

scientific article
Language Label Description Also known as
English
Approximations for generalized unsplittable flow on paths with application to power systems optimization
scientific article

    Statements

    Approximations for generalized unsplittable flow on paths with application to power systems optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 January 2023
    0 references
    unsplittable flow problem
    0 references
    QPTAS
    0 references
    LP rounding
    0 references
    logarithmic approximation
    0 references
    power systems engineering
    0 references
    AC optimal power flow
    0 references
    0 references
    0 references

    Identifiers