Pages that link to "Item:Q2643963"
From MaRDI portal
The following pages link to Accelerating column generation for variable sized bin-packing problems (Q2643963):
Displaying 8 items.
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges (Q296762) (← links)
- An investigation into two bin packing problems with ordering and orientation implications (Q421577) (← links)
- 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)
- An asymptotic approximation scheme for the concave cost bin packing problem (Q933537) (← links)
- An iterated greedy algorithm for the planning of yarn‐dyeing boilers (Q6060692) (← links)
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts (Q6167663) (← links)
