Pages that link to "Item:Q1319674"
From MaRDI portal
The following pages link to Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems (Q1319674):
Displaying 15 items.
- A greedy heuristic for 3-partitioning with similar elements (Q685863) (← links)
- Worst case analysis of a greedy algorithm for graph thickness (Q1007554) (← links)
- Worst-case analysis of an approximation scheme for the subset-sum problem (Q1089266) (← links)
- Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations (Q1125006) (← links)
- A linear compound algorithm for uniform machine scheduling (Q1266304) (← links)
- Worst-case analysis of the subset sum algorithm for bin packing. (Q1417595) (← links)
- Two linear approximation algorithms for the subset-sum problem (Q1969831) (← links)
- Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem (Q1977259) (← links)
- Worst-case performance of the successive approximation algorithm for four identical knapsacks (Q2450816) (← links)
- Worst-case analysis of the differencing method for the partition problem (Q3750527) (← links)
- Worst case analysis of two heuristics for the set partitioning problem (Q3774940) (← links)
- (Q4252388) (← links)
- Linear compound algorithms for the partitioning problem (Q4526868) (← links)
- On the Complexity of Minimizing the Total Calibration Cost (Q4632198) (← links)
- AN APPROACH FOR WORST CASE ANALYSIS OF HEURISTICS : ANALYSIS OF A FLEXIBLE 0-1 KNAPSACK PROBLEM (Q4834043) (← links)
