A heuristic method for solving the problem of partitioning graphs with supply and demand
From MaRDI portal
Publication:256649
DOI10.1007/s10479-015-1930-5zbMath1332.90327arXiv1411.1080OpenAlexW1558032106MaRDI QIDQ256649
Abdelkader Bousselham, Raka Jovanovic, Stefan Voß
Publication date: 9 March 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.1080
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
A heuristic approach for dividing graphs into bi-connected components with a size constraint ⋮ Partitioning of supply/demand graphs with capacity limitations: an ant colony approach ⋮ 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
- Tree \(t\)-spanners in outerplanar graphs via supply demand partition
- An efficient memetic algorithm for the graph partitioning problem
- Balanced graph partitioning
- Approximability of partitioning graphs with supply and demand
- A bionomic approach to the capacitated \(p\)-median problem
- Lock-gain based graph partitioning
- Minimum cost partitions of trees with supply and demand
- Generating partitions of a graph into a fixed number of minimum weight cuts
- Computing finest mincut partitions of a graph and application to routing problems
- Expanding neighborhood GRASP for the traveling salesman problem
- A scatter search heuristic for the capacitated clustering problem
- A New Heuristic for Partitioning the Nodes of a Graph
- An Efficient Heuristic Procedure for Partitioning Graphs
- Modelling the Power Supply Network – Hardness and Approximation
- Parametric Power Supply Networks
- A Method for Solving Traveling-Salesman Problems
- PARTITIONING TREES OF SUPPLY AND DEMAND
This page was built for publication: A heuristic method for solving the problem of partitioning graphs with supply and demand
