Augmented neural networks and problem structure-based heuristics for the bin-packing problem
From MaRDI portal
Recommendations
- Theoretical insights into the augmented-neural-network approach for combinatorial optimization
- Augmented neural networks for task scheduling.
- Incremental bin packing
- Non‐greedy heuristics and augmented neural networks for the open‐shop scheduling problem
- An improved augmented neural-network approach for scheduling problems
Cites work
- A hybrid approach for optimization of one-dimensional cutting
- A morph-based simulated annealing heuristic for a modified bin-packing problem
- Augmented neural networks for task scheduling.
- Bin-packing by simulated annealing
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Hybrid genetic algorithms for bin-packing and related problems
- NeuroGenetic approach for combinatorial optimization: an exploratory analysis
- New heuristics for one-dimensional bin-packing
- Solving the one-dimensional bin packing problem with a weight annealing heuristic
- Theoretical insights into the augmented-neural-network approach for combinatorial optimization
- Two heuristics for the one-dimensional bin-packing problem
- Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures
Cited in
(3)
This page was built for publication: Augmented neural networks and problem structure-based heuristics for the bin-packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5497425)