Pages that link to "Item:Q1934311"
From MaRDI portal
The following pages link to Minimum cost partitions of trees with supply and demand (Q1934311):
Displaying 12 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)
- Decentralized pricing in minimum cost spanning trees (Q612004) (← links)
- Approximability of partitioning graphs with supply and demand (Q1002107) (← links)
- Finding minimum cost directed trees with demands and capacities (Q1179742) (← links)
- Partitioning of supply/demand graphs with capacity limitations: an ant colony approach (Q1698074) (← links)
- Parametric power supply networks (Q2354290) (← links)
- A heuristic approach for dividing graphs into bi-connected components with a size constraint (Q2403269) (← links)
- Minimum Cost Partitions of Trees with Supply and Demand (Q3060787) (← links)
- Parameterized Minimum Cost Partition of a Tree with Supply and Demand (Q3452563) (← links)
- Parametric Power Supply Networks (Q4925242) (← links)
- Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs (Q5433194) (← links)
