Parametric power supply networks

DOI10.1007/s10878-013-9661-5zbMath1328.90128OpenAlexW2040852780MaRDI QIDQ2354290

Shiho Morishita, Takao Nishizeki

Publication date: 10 July 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-013-9661-5

zbMATH Keywords

treealgorithmgraphpower supplyparametric network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (5)

Parameterized Minimum Cost Partition of a Tree with Supply and Demand ⋮ A branch-and-price algorithm for capacitated hypergraph vertex separation ⋮ Partition on trees with supply and demand: kernelization and algorithms ⋮ A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs ⋮ A strongly polynomial time algorithm for the maximum supply rate problem on trees

Cites Work

• Unnamed Item
• Partitioning graphs of supply and demand
• Approximability of partitioning graphs with supply and demand
• Minimum cost partitions of trees with supply and demand
• Multicommodity demand flow in a tree and packing integer programs
• Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
• A Fast Parametric Maximum Flow Algorithm and Applications
• PARTITIONING TREES OF SUPPLY AND DEMAND
• Parametric Network Flows

This page was built for publication: Parametric power supply networks