Pages that link to "Item:Q1762087"
From MaRDI portal
The following pages link to Variable neighbourhood search for the variable sized bin packing problem (Q1762087):
Displaying 16 items.
- A hybrid algorithm based on variable neighbourhood for the strip packing problem (Q306099) (← 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)
- Heuristics for the variable sized bin-packing problem (Q1017465) (← 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 neighborhood search for quadratic multiple constraint variable sized bin-packing problem (Q2147064) (← links)
- Solving the variable size bin packing problem with discretized formulations (Q2462559) (← links)
- A variable neighborhood descent approach for the two-dimensional bin packing problem (Q2631240) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem (Q2701176) (← links)
- (Q4900928) (← links)
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← 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)
- A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem (Q6536478) (← links)
