Pages that link to "Item:Q4526868"
From MaRDI portal
The following pages link to Linear compound algorithms for the partitioning problem (Q4526868):
Displaying 19 items.
- Partitioning strategies for the block Cimmino algorithm (Q525251) (← links)
- Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem (Q819064) (← links)
- Linear time algorithms for parallel machine scheduling (Q856829) (← links)
- Parameterized algorithmics for linear arrangement problems (Q1003461) (← links)
- Two semi-online scheduling problems on two uniform machines (Q1006050) (← links)
- A linear time algorithm for graph partition problems (Q1198016) (← links)
- A linear compound algorithm for uniform machine scheduling (Q1266304) (← links)
- Semi on-line algorithms for the partition problem (Q1267197) (← links)
- Linear-shaped partition problems (Q1577471) (← links)
- Multiprofessor scheduling (Q1686063) (← links)
- The multifit algorithm for set partitioning containing kernels (Q1807874) (← links)
- Least-cost partition algorithms (Q1823166) (← links)
- The longest processing time rule for identical parallel machines revisited (Q2173053) (← links)
- A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem (Q2424829) (← links)
- An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines (Q2463519) (← links)
- Two algorithms for general list matrix partitions (Q2921752) (← links)
- A Linear Time Algorithm for Ordered Partition (Q3452555) (← links)
- Approximation algorithms for array partitioning problems (Q4651813) (← links)
- Horizontal partitions and Kleshchev's algorithm (Q4885208) (← links)
