A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs

DOI10.1007/s11590-015-0972-6zbMath1364.90331OpenAlexW2282185522MaRDI QIDQ518138

Raka Jovanovic, Stefan Voß

Publication date: 28 March 2017

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-015-0972-6

zbMATH Keywords

mixed integer programminggraph partitioningdemand vertexsupply vertex

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items (1)

A heuristic approach for dividing graphs into bi-connected components with a size constraint

Cites Work

• Unnamed Item
• A heuristic method for solving the problem of partitioning graphs with supply and demand
• Tree \(t\)-spanners in outerplanar graphs via supply demand partition
• Approximability of partitioning graphs with supply and demand
• Partitioning of supply/demand graphs with capacity limitations: an ant colony approach
• Parametric power supply networks
• Spanning Distribution Forests of Graphs
• Parameterized Minimum Cost Partition of a Tree with Supply and Demand
• Modelling the Power Supply Network – Hardness and Approximation
• Parametric Power Supply Networks
• Spanning Distribution Trees of Graphs
• PARTITIONING TREES OF SUPPLY AND DEMAND

This page was built for publication: A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs