Pages that link to "Item:Q1417595"
From MaRDI portal
The following pages link to Worst-case analysis of the subset sum algorithm for bin packing. (Q1417595):
Displaying 25 items.
- Parametric packing of selfish items and the subset sum algorithm (Q261356) (← links)
- A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services (Q297101) (← links)
- Constrained order packing: comparison of heuristic approaches for a new bin packing problem (Q300978) (← links)
- A hybrid algorithm for constrained order packing (Q301159) (← links)
- Selfish bin packing with cardinality constraints (Q391143) (← links)
- Online variable-sized bin packing with conflicts (Q429693) (← links)
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem (Q531429) (← links)
- Selfish bin packing (Q534779) (← links)
- Relaxations and exact solution of the variable sized bin packing problem (Q535302) (← links)
- A greedy heuristic for 3-partitioning with similar elements (Q685863) (← links)
- Heuristics for the variable sized bin-packing problem (Q1017465) (← links)
- A successive approximation algorithm for the multiple knapsack problem (Q1029265) (← links)
- Modified subset sum heuristics for bin packing (Q1044695) (← links)
- Worst-case analysis of an approximation scheme for the subset-sum problem (Q1089266) (← links)
- Worst-case analyses, linear programming and the bin-packing problem (Q1290661) (← links)
- Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems (Q1319674) (← links)
- Matheuristics for the irregular bin packing problem with free rotations (Q1751657) (← links)
- Efficient algorithms for real-life instances of the variable size bin packing problem (Q1761234) (← links)
- Quality of equilibria for selfish bin packing with cost sharing variants (Q2218642) (← links)
- Quality of strong equilibria for selfish bin packing with uniform cost sharing (Q2304118) (← links)
- Worst-case performance of the successive approximation algorithm for four identical knapsacks (Q2450816) (← links)
- Selfish Bin Packing (Q3541100) (← links)
- New worst-case results for the bin-packing problem (Q4290987) (← links)
- Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures (Q4301293) (← links)
- Lower and upper bounding procedures for the bin packing problem with concave loading cost (Q6069214) (← links)