a generalized network flow model with application to power supply-demand problems

DOI10.1002/NET.3230140110MaRDI QIDQ3330939zbMATH OpenOpenAlexFDO

Authors Chen-Ching Liu, Felix Wu

Publication date 1984

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230140110

zbMATH Keywords

compact flow networksmax flow min cut theoremminimal cutsupply demand theorems

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Modelling the power supply network -- hardness and approximation
• Approximations for generalized unsplittable flow on paths with application to power systems optimization
• scientific article; zbMATH DE number 3959084
• New models of the generalized fixed-charge network design problem
• Optimal power flow analysis in power dispatch for distribution networks
• A Non-Serial Dynamic Programming Model with an Application to the Optimal Design of Distribution Networks
• Distribution network design: New problems and related models
• An optimization-based conjectured supply function equilibrium model for network constrained electricity markets
• Dynamic network flows for generalized Kirchhoff law
• Modelling network constrained economic dispatch problems

Cites work

• scientific article; zbMATH DE number 3791942 (Why is no real title available?)
• scientific article; zbMATH DE number 3446921 (Why is no real title available?)
• scientific article; zbMATH DE number 3221579 (Why is no real title available?)
• Steady-State Security Regions of Power Systems

Cited in

(2)

• A compaction scheme and generator for distribution networks
• Maximum outflow in generalized flow networks

This page was built for publication: a generalized network flow model with application to power supply-demand problems

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