Pages that link to "Item:Q2719124"
From MaRDI portal
The following pages link to Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms (Q2719124):
Displaying 17 items.
- Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items (Q490206) (← links)
- Relaxations and exact solution of the variable sized bin packing problem (Q535302) (← links)
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (Q610980) (← links)
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555) (← links)
- A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan'' (Q1015007) (← links)
- Heuristics for the variable sized bin-packing problem (Q1017465) (← links)
- Variable neighbourhood search for the variable sized bin packing problem (Q1762087) (← links)
- Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem (Q2147064) (← links)
- An exact algorithm for the type-constrained and variable sized bin packing problem (Q2267302) (← links)
- Packing items to feed assembly lines (Q2384618) (← links)
- Efficient algorithms for the offline variable sized bin-packing problem (Q2434654) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- Accelerating column generation for variable sized bin-packing problems (Q2643963) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- (Q4723300) (← links)
- An iterated greedy algorithm for the planning of yarn‐dyeing boilers (Q6060692) (← links)
- A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem (Q6536478) (← links)
