Pages that link to "Item:Q5955558"
From MaRDI portal
The following pages link to New classes of fast lower bounds for bin packing problems (Q5955558):
Displaying 17 items.
- Computing the asymptotic worst-case of bin packing lower bounds (Q2643960) (← links)
- Arc-flow model for the two-dimensional guillotine cutting stock problem (Q2654387) (← links)
- A linear programming approach for the three-dimensional bin-packing problem (Q2861521) (← links)
- New Lower Bounds for Certain Classes of Bin Packing Algorithms (Q3075446) (← links)
- A branch-and-price-and-cut algorithm for the pattern minimization problem (Q3163667) (← links)
- Online Square Packing (Q3183464) (← links)
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)
- Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem (Q4979988) (← links)
- (Q5088965) (← links)
- Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers (Q5131692) (← links)
- A Multi-start Tabu Search Based Algorithm for Solving the Warehousing Problem with Conflict (Q5357746) (← links)
- Consecutive ones matrices for multi-dimensional orthogonal packing problems (Q5917883) (← links)
- A new lower bound for classic online bin packing (Q5918895) (← links)
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts (Q6167663) (← links)
- Chance-constrained stochastic assembly line balancing with branch, bound and remember algorithm (Q6547003) (← links)
- A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem (Q6568392) (← links)
- Algorithms for the bin packing problem with scenarios (Q6646755) (← links)
