PARTITIONING TREES OF SUPPLY AND DEMAND
From MaRDI portal
Cites work
- A linear-time algorithm for four-partitioning four-connected planar graphs
- An exact algorithm for large multiple knapsack problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Max-Min Tree Partitioning
- On the complexity of partitioning graphs into connected subgraphs
Cited in
(13)- Approximability of partitioning graphs with supply and demand
- Partitioning of supply/demand graphs with capacity limitations: an ant colony approach
- Minimum cost partitions of trees with supply and demand
- Parametric power supply networks
- A heuristic method for solving the problem of partitioning graphs with supply and demand
- Minimum Cost Partitions of Trees with Supply and Demand
- Parameterized Minimum Cost Partition of a Tree with Supply and Demand
- Parametric power supply networks (extended abstract)
- 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
- On the complexity of reconfiguration problems
- Partitioning graphs of supply and demand
This page was built for publication: PARTITIONING TREES OF SUPPLY AND DEMAND
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5462677)
