Exact solution of the two-dimensional finite bin packing problem
From MaRDI portal
Recommendations
- Exact solution techniques for two-dimensional cutting and packing
- Two-Dimensional Finite Bin-Packing Algorithms
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- An exact algorithm for the two-dimensional strip-packing problem
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
Cited in
(only showing first 100 items - show all)- An agent-based approach to the two-dimensional guillotine bin packing problem
- Bidimensional packing by bilinear programming
- A branch and bound algorithm for the strip packing problem
- Local search of orthogonal packings using the lower bounds
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms
- A lower bound for the non-oriented two-dimensional bin packing problem
- On the two-dimensional knapsack problem
- Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles
- Improved filtering for the bin-packing with cardinality constraint
- Provider selection and task allocation in telecommunications with QoS degradation policy
- Logic based Benders' decomposition for orthogonal stock cutting problems
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
- A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem
- A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
- Product packing and stacking under uncertainty: a robust approach
- A sequential value correction heuristic for a bi-objective two-dimensional bin-packing
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
- Approximation algorithm for the oriented two-dimensional bin packing problem
- New lower bounds for the three-dimensional finite bin packing problem
- Two-dimensional packing problems: a survey
- An exact algorithm for the dual bin packing problem
- Exact solution of the 2-dimensional grid arrangement problem
- Space defragmentation for packing problems
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- Exact solution techniques for two-dimensional cutting and packing
- Queue-constrained packing: a vehicle ferry case study
- The maximum diversity assortment selection problem
- A hybrid metaheuristic for the two-dimensional strip packing problem
- 2DPackLib: a two-dimensional cutting and packing library
- Solving a large cutting problem in the glass manufacturing industry
- Lower bounds for three-dimensional multiple-bin-size bin packing problems
- An exact algorithm for the type-constrained and variable sized bin packing problem
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing
- Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- A three-dimensional bin-packing model: exact multicriteria solution and computational complexity
- On solving multiobjective bin packing problems using evolutionary particle swarm optimization
- Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds
- A new constraint programming approach for the orthogonal packing problem
- A new exact method for the two-dimensional bin-packing problem with fixed orientation
- A new lower bound for the non-oriented two-dimensional bin-packing problem
- New resolution algorithm and pretreatments for the two-dimensional 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
- Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search
- An improved typology of cutting and packing problems
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- A new exact method for the two-dimensional orthogonal packing problem
- Models and algorithms for three-stage two-dimensional bin packing
- Single batch machine scheduling with dual setup times for autoclave molding manufacturing
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- Capping methods for the automatic configuration of optimization algorithms
- Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques
- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
- SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects
- A computational study of lower bounds for the two dimensional bin packing problem
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
- Combinatorial Benders' cuts for the strip packing problem
- An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem
- 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems
- A hybrid heuristic algorithm for the 2D variable-sized bin packing problem
- Metaheuristics for truck loading in the car production industry
- A block-based layer building approach for the 2D guillotine strip packing problem
- Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
- Heuristics with stochastic neighborhood structures for two-dimensional bin packing and cutting stock problems
- A heuristic for solving large bin packing problems in two and three dimensions
- Constrained order packing: comparison of heuristic approaches for a new bin packing problem
- A hybrid algorithm for constrained order packing
- Two-dimensional bin packing problems
- A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang
- A hybrid algorithm based on variable neighbourhood for the strip packing problem
- New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
- A simple randomized algorithm for two-dimensional strip packing
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
- An exact strip packing algorithm based on canonical forms
- One-dimensional relaxations and LP bounds for orthogonal packing
- Analysis of distributed genetic algorithms for solving cutting problems
- The load-balanced multi-dimensional bin-packing problem
- A model to design recreational boat mooring fields
- Two-Dimensional Finite Bin-Packing Algorithms
- Algorithms for nesting with defects
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
- The two dimensional bin packing problem with side constraints
- Relations between capacity utilization, minimal bin size and bin number
- New lower bound and exact method for the continuous berth allocation problem
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- Using heuristic algorithms for capacity leasing and task allocation issues in telecommunication networks under fuzzy quality of service constraints
- Lower bounds and algorithms for the 2-dimensional vector packing problem
- Fuzzy bin packing problem.
- An introduction to the two‐dimensional rectangular cutting and packing problem
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems
- Routing problems with loading constraints
This page was built for publication: Exact solution of the two-dimensional finite bin packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2783932)
