Pages that link to "Item:Q5939270"

The following pages link to Bounds for the cardinality constrained \(P \|C_{max}\) problem (Q5939270):

Displaying 13 items.

• A 3/2-approximation algorithm for \(k_i\)-partitioning (Q408403) (← links)
• Minimizing total completion time on a single machine with a flexible maintenance activity (Q613512) (← links)
• Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem (Q819064) (← 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)
• \(\kappa\)-partitioning problems for maximizing the minimum load (Q1879573) (← 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 annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
• (Q5136271) (← links)
• EPTAS for the dual of splittable bin packing with cardinality constraint (Q6057843) (← links)
• EPTAS for parallel identical machine scheduling with time restrictions (Q6123390) (← links)