Convex Relaxations of the Network Flow Problem Under Cycle Constraints

DOI10.1109/TCNS.2019.2915390MaRDI QIDQ4969352zbMATH OpenFDO

Authors Madi Zholbaryssov, Alejandro D. Domínguez-García

Publication date 5 October 2020

Published in IEEE Transactions on Control of Network Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TCNS.2019.2915390

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX) Systems theory; control (93-XX)

Cited in

(3)

• Frequency-driven market mechanisms for optimal dispatch in power networks
• A bilinear relaxation based algorithm for concave piecewise linear network flow problems
• Modeling bidirectional flows in gas networks

This page was built for publication: Convex Relaxations of the Network Flow Problem Under Cycle Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969352)