The following pages link to The \(k\)-partitioning problem (Q1298757):
Displaying 40 items.
- Optimizing the strategic patient mix combining queueing theory and dynamic programming (Q336926) (← links)
- A 3/2-approximation algorithm for \(k_i\)-partitioning (Q408403) (← links)
- Computer-assisted proof of performance ratios for the differencing method (Q435724) (← links)
- Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem (Q819064) (← links)
- The mean-partition problem (Q857804) (← links)
- Fast discrete consensus based on gossip for makespan minimization in networked systems (Q889003) (← links)
- Lower bounds and modified LPT algorithm for \(k\)-partitioning problems with partition matroid constraint (Q933069) (← links)
- The solution to the partition reconstruction problem (Q1003623) (← links)
- \(k\)-partitioning problems with partition matroid constraint (Q1022585) (← links)
- Reduction of the three-partition problem (Q1304381) (← links)
- A tight bound for 3-partitioning (Q1309812) (← links)
- Gossip based asynchronous and randomized distributed task assignment with guaranteed performance on heterogeneous networks (Q1680837) (← links)
- The maximum saving partition problem (Q1779697) (← links)
- The multifit algorithm for set partitioning containing kernels (Q1807874) (← links)
- \(\kappa\)-partitioning problems for maximizing the minimum load (Q1879573) (← links)
- The Knowlton-Graham partition problem (Q1906132) (← links)
- Three-partitioning containing kernels: Complexity and heuristic (Q1924322) (← links)
- Optimal matroid partitioning problems (Q2032344) (← links)
- Feasibility criteria for high-multiplicity partitioning problems (Q2069802) (← links)
- Dividing splittable goods evenly and with limited fragmentation (Q2309472) (← links)
- A new approach for bicriteria partitioning problem (Q2355323) (← links)
- Approximation algorithms for \(k\)-partitioning problems with partition matroid constraint (Q2448182) (← links)
- Minimizing labor requirements in a periodic vehicle loading problem (Q2490369) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- Min-Max partitioning problem with matroid constraint (Q2519447) (← links)
- On uniform \(k\)-partition problems (Q2565854) (← links)
- Operations research models for coalition structure in collaborative logistics (Q2629609) (← links)
- (Q2723960) (← links)
- An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints (Q2958349) (← links)
- A simple solution to the <i>k</i>‐core problem (Q3419611) (← links)
- Short-term capacity allocation problem with tool and setup constraints (Q3442914) (← links)
- One-Half Approximation Algorithms for the k-Partition Problem (Q3990575) (← links)
- Heuristic scheduling of parallel machines with sequence-dependent set-up times (Q4443334) (← links)
- Linear compound algorithms for the partitioning problem (Q4526868) (← links)
- Optimal Multi-Way Number Partitioning (Q4625646) (← links)
- The $k$ -Equal Problem (Q4660553) (← links)
- Horizontal partitions and Kleshchev's algorithm (Q4885208) (← links)
- Optimal matroid partitioning problems (Q5136271) (← links)
- Bounds for the cardinality constrained \(P \|C_{max}\) problem (Q5939270) (← links)
- Parallel machine scheduling with linearly increasing energy consumption cost (Q6113068) (← links)
