Pages that link to "Item:Q4922115"
From MaRDI portal
The following pages link to Modelling the Power Supply Network – Hardness and Approximation (Q4922115):
Displaying 6 items.
- A heuristic method for solving the problem of partitioning graphs with supply and demand (Q256649) (← links)
- Partition on trees with supply and demand: kernelization and algorithms (Q507429) (← links)
- A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs (Q518138) (← links)
- Partitioning of supply/demand graphs with capacity limitations: an ant colony approach (Q1698074) (← links)
- A heuristic approach for dividing graphs into bi-connected components with a size constraint (Q2403269) (← links)
- Parameterized Minimum Cost Partition of a Tree with Supply and Demand (Q3452563) (← links)
