Pages that link to "Item:Q1178644"
From MaRDI portal
The following pages link to An extension of a greedy heuristic for the knapsack problem (Q1178644):
Displaying 13 items.
- Comparison and analysis of ten static heuristics-based Internet data replication techniques (Q436652) (← links)
- A total-value greedy heuristic for the integer knapsack problem (Q1200766) (← links)
- A complementary greedy heuristic for the knapsack problem (Q1203804) (← links)
- Joint performance of greedy heuristics for the integer knapsack problem (Q1343153) (← links)
- A special class parametric of knapsack problems: Analytic aids and heuristics (Q1390270) (← links)
- Average performance of greedy heuristics for the integer knapsack problem. (Q1420409) (← links)
- A class of generalized greedy algorithms for the multi-knapsack problem (Q1803680) (← links)
- Smart greedy procedure for solving a nonlinear knapsack class of reliability optimization problems (Q1905883) (← links)
- Sensitivity analysis of a greedy heuristic for knapsack problems (Q2569123) (← links)
- On pleasant but not completely pleasant knapsack problems (Q2770788) (← links)
- Algorithms with guarantee value for knapsack problems (Q2903135) (← links)
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem (Q3466782) (← links)
- Heuristics for the 0-1 min-knapsack problem (Q3988807) (← links)