Algorithms for packing and scheduling problems. (Abstract of thesis)
From MaRDI portal
Cited in
(18)- Heuristics for the variable sized bin-packing problem
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- Mixed-integer linear programming heuristics for the prepack optimization problem
- A generalized bin packing problem for parcel delivery in last-mile logistics
- Variable neighbourhood search for the variable sized bin packing problem
- Solving bin packing problems using VRPSolver models
- Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem
- Lower bounds for three-dimensional multiple-bin-size bin packing problems
- An exact algorithm for the type-constrained and variable sized bin packing problem
- Efficient algorithms for the offline variable sized bin-packing problem
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- The two-dimensional bin packing problem with variable bin sizes and costs
- Accelerating column generation for variable sized bin-packing problems
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
- Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
- Relaxations and exact solution of the variable sized bin packing problem
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
This page was built for publication: Algorithms for packing and scheduling problems. (Abstract of thesis)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1429294)
