Pages that link to "Item:Q1017465"
From MaRDI portal
The following pages link to Heuristics for the variable sized bin-packing problem (Q1017465):
Displaying 9 items.
- A hybrid algorithm based on variable neighbourhood for the strip packing problem (Q306099) (← 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)
- Heuristics for the variable sized bin-packing problem (Q1017465) (← links)
- Minimizing the number of stations and station activation costs for a production line (Q1652155) (← links)
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function (Q1753400) (← links)
- A generalized bin packing problem for parcel delivery in last-mile logistics (Q1755394) (← links)
- Efficient algorithms for real-life instances of the variable size bin packing problem (Q1761234) (← links)
- Variable neighbourhood search for the variable sized bin packing problem (Q1762087) (← links)
