Pages that link to "Item:Q2783932"
From MaRDI portal
The following pages link to Exact solution of the two-dimensional finite bin packing problem (Q2783932):
Displaying 50 items.
- 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems (Q296590) (← links)
- A hybrid heuristic algorithm for the 2D variable-sized bin packing problem (Q296697) (← links)
- A block-based layer building approach for the 2D guillotine strip packing problem (Q297057) (← links)
- Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem (Q297181) (← links)
- A heuristic for solving large bin packing problems in two and three dimensions (Q300728) (← links)
- Constrained order packing: comparison of heuristic approaches for a new bin packing problem (Q300978) (← links)
- A hybrid algorithm for constrained order packing (Q301159) (← links)
- A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang (Q306089) (← links)
- A hybrid algorithm based on variable neighbourhood for the strip packing problem (Q306099) (← links)
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems (Q336709) (← links)
- A simple randomized algorithm for two-dimensional strip packing (Q339530) (← links)
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts (Q339606) (← links)
- An exact strip packing algorithm based on canonical forms (Q339635) (← links)
- The load-balanced multi-dimensional bin-packing problem (Q342477) (← links)
- Algorithms for nesting with defects (Q406491) (← links)
- A skyline heuristic for the 2D rectangular packing and strip packing problems (Q421662) (← links)
- Relations between capacity utilization, minimal bin size and bin number (Q490141) (← links)
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem (Q609809) (← links)
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing (Q610979) (← links)
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems (Q610988) (← links)
- Routing problems with loading constraints (Q610992) (← links)
- The off-line group seat reservation problem (Q613435) (← links)
- A squeaky wheel optimisation methodology for two-dimensional strip packing (Q622159) (← links)
- A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts (Q632697) (← links)
- Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution (Q664176) (← links)
- Recent advances on two-dimensional bin packing problems (Q697576) (← links)
- The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem (Q724050) (← links)
- Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints (Q729798) (← links)
- Packing into the smallest square: worst-case analysis of lower bounds (Q865748) (← links)
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation (Q868985) (← links)
- Two- and three-dimensional parametric packing (Q875405) (← links)
- Reactive GRASP for the strip-packing problem (Q941532) (← links)
- Ant colony optimization for the two-dimensional loading vehicle routing problem (Q955597) (← links)
- New lower bounds for bin packing problems with conflicts (Q976310) (← links)
- An agent-based approach to the two-dimensional guillotine bin packing problem (Q1011220) (← links)
- Bidimensional packing by bilinear programming (Q1016113) (← links)
- A branch and bound algorithm for the strip packing problem (Q1017971) (← links)
- Local search of orthogonal packings using the lower bounds (Q1040483) (← links)
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms (Q1339128) (← links)
- A lower bound for the non-oriented two-dimensional bin packing problem (Q1348248) (← links)
- On the two-dimensional knapsack problem (Q1433651) (← links)
- Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles (Q1580968) (← links)
- Improved filtering for the bin-packing with cardinality constraint (Q1617384) (← links)
- Provider selection and task allocation in telecommunications with QoS degradation policy (Q1639237) (← links)
- Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation (Q1652199) (← links)
- A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem (Q1665961) (← links)
- A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints (Q1681135) (← links)
- Product packing and stacking under uncertainty: a robust approach (Q1740542) (← links)