Pages that link to "Item:Q1761234"
From MaRDI portal
The following pages link to Efficient algorithms for real-life instances of the variable size bin packing problem (Q1761234):
Displaying 12 items.
- Real time asymptotic packing (Q1378545) (← links)
- Local search algorithms for the bin packing problem and their relationships to various construction heuristics (Q1402503) (← links)
- Variable neighbourhood search for the variable sized bin packing problem (Q1762087) (← links)
- An exact algorithm for the type-constrained and variable sized bin packing problem (Q2267302) (← links)
- One-dimensional stock cutting: optimization of usable leftovers in consecutive orders (Q2401325) (← links)
- Efficient algorithms for the offline variable sized bin-packing problem (Q2434654) (← links)
- A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games (Q2664449) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover (Q2803258) (← 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)
