Pages that link to "Item:Q2434654"
From MaRDI portal
The following pages link to Efficient algorithms for the offline variable sized bin-packing problem (Q2434654):
Displaying 12 items.
- An AFPTAS for variable sized bin packing with general activation costs (Q340560) (← links)
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (Q610980) (← 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)
- Algorithms for the variable sized bin packing problem (Q1869719) (← links)
- An exact algorithm for the type-constrained and variable sized bin packing problem (Q2267302) (← 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)
- 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)
