Partitioning of supply/demand graphs with capacity limitations: an ant colony approach
From MaRDI portal
(Redirected from Publication:1698074)
Recommendations
- Partitioning graphs of supply and demand
- A heuristic method for solving the problem of partitioning graphs with supply and demand
- Modelling the power supply network -- hardness and approximation
- A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs
- scientific article; zbMATH DE number 1979534
Cites work
- A heuristic method for solving the problem of partitioning graphs with supply and demand
- A New Heuristic for Partitioning the Nodes of a Graph
- Ant colony optimization theory: a survey
- Approximability of partitioning graphs with supply and demand
- Balanced graph partitioning
- Computing finest mincut partitions of a graph and application to routing problems
- Generating partitions of a graph into a fixed number of minimum weight cuts
- Greedy randomized adaptive search procedures
- Looking ahead with the pilot method
- Minimum cost partitions of trees with supply and demand
- Modelling the power supply network -- hardness and approximation
- Parametric power supply networks (extended abstract)
- PARTITIONING TREES OF SUPPLY AND DEMAND
- Semi-greedy heuristics: An empirical study
Cited in
(3)- Model and algorithm of routes planning for emergency relief distribution in disaster management with disaster information update
- A heuristic method for solving the problem of partitioning graphs with supply and demand
- A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs
This page was built for publication: Partitioning of supply/demand graphs with capacity limitations: an ant colony approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1698074)
