Pages that link to "Item:Q686520"
From MaRDI portal
The following pages link to A shifting algorithm for constrained min-max partition on trees (Q686520):
Displayed 11 items.
- Efficient implementation of a shifting algorithm (Q1070825) (← links)
- Min-max optimization of several classical discrete optimization problems (Q1265052) (← links)
- Divider-based algorithms for hierarchical tree partitioning. (Q1427182) (← links)
- Uniform and most uniform partitions of trees (Q1756346) (← links)
- Most uniform path partitioning and its use in image processing (Q1803677) (← links)
- The shifting algorithm technique for the partitioning of trees (Q1900135) (← links)
- Tree partitioning under constraints. -- Clustering for vehicle routing problems (Q1962035) (← links)
- A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees (Q3339302) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
- Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows (Q6107888) (← links)
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)