Pages that link to "Item:Q1362971"
From MaRDI portal
The following pages link to BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem (Q1362971):
Displaying 8 items.
- Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB) (Q5189096) (← links)
- Augmented neural networks and problem structure-based heuristics for the bin-packing problem (Q5497425) (← links)
- New heuristics for one-dimensional bin-packing (Q5959374) (← links)
- One-dimensional stock cutting resilient against singular random defects (Q6106587) (← links)
- Security-aware database migration planning (Q6154181) (← links)
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts (Q6167663) (← links)
- A Study of Bi-space Search for Solving the One-Dimensional Bin Packing Problem (Q6487995) (← links)
- Local-search based heuristics for advertisement scheduling (Q6658437) (← links)