The following pages link to A tight bound for 3-partitioning (Q1309812):
Displaying 16 items.
- Computer-assisted proof of performance ratios for the differencing method (Q435724) (← links)
- A greedy heuristic for 3-partitioning with similar elements (Q685863) (← links)
- 3-partitioning problems for maximizing the minimum load (Q702354) (← links)
- Lower bounds and modified LPT algorithm for \(k\)-partitioning problems with partition matroid constraint (Q933069) (← links)
- \(k\)-partitioning problems with partition matroid constraint (Q1022585) (← links)
- The \(k\)-partitioning problem (Q1298757) (← links)
- Reduction of the three-partition problem (Q1304381) (← links)
- A 3/4-approximation algorithm for multiple subset sum (Q1402509) (← links)
- \(\kappa\)-partitioning problems for maximizing the minimum load (Q1879573) (← links)
- Three-partitioning containing kernels: Complexity and heuristic (Q1924322) (← links)
- Optimal matroid partitioning problems (Q2032344) (← links)
- Optimizing crew rostering with multilicense on high-speed railway lines (Q2321537) (← links)
- Approximation algorithms for \(k\)-partitioning problems with partition matroid constraint (Q2448182) (← links)
- An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints (Q2958349) (← links)
- Three Partition Refinement Algorithms (Q3801084) (← links)
- Optimal matroid partitioning problems (Q5136271) (← links)
