Pages that link to "Item:Q4427380"
From MaRDI portal
The following pages link to Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems (Q4427380):
Displaying 50 items.
- Integrated distribution and loading planning via a compact metaheuristic algorithm (Q257219) (← 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)
- 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 variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints (Q319206) (← links)
- The disruptive anti-covering location problem (Q320083) (← links)
- The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints (Q322687) (← links)
- A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls (Q323548) (← links)
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP (Q337416) (← 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)
- Models and algorithms for packing rectangles into the smallest square (Q342053) (← links)
- Bin packing and related problems: general arc-flow formulation with graph compression (Q342316) (← links)
- Packing, covering and tiling in two-dimensional spaces (Q472930) (← links)
- Routing problems with loading constraints (Q610992) (← links)
- A squeaky wheel optimisation methodology for two-dimensional strip packing (Q622159) (← links)
- Maximizing revenue with allocation of multiple advertisements on a Web banner (Q632692) (← links)
- A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts (Q632697) (← links)
- Recent advances on two-dimensional bin packing problems (Q697576) (← links)
- Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints (Q729798) (← links)
- The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio (Q732899) (← links)
- Characterization and modelling of guillotine constraints (Q930945) (← links)
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem (Q941553) (← links)
- Ant colony optimization for the two-dimensional loading vehicle routing problem (Q955597) (← links)
- A least wasted first heuristic algorithm for the rectangular packing problem (Q960413) (← links)
- An agent-based approach to the two-dimensional guillotine bin packing problem (Q1011220) (← links)
- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem (Q1015322) (← links)
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints (Q1038331) (← links)
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
- A lower bound for the non-oriented two-dimensional bin packing problem (Q1348248) (← links)
- Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
- Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem (Q1686525) (← links)
- A sequential value correction heuristic for a bi-objective two-dimensional bin-packing (Q1742194) (← links)
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts (Q1754728) (← links)
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint (Q1761795) (← links)
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows (Q1788902) (← links)
- New lower bounds for the three-dimensional finite bin packing problem (Q1827849) (← links)
- Two-dimensional packing problems: a survey (Q1847188) (← links)
- Heuristic algorithms for the three-dimensional bin packing problem (Q1847192) (← links)
- Space defragmentation for packing problems (Q1926954) (← links)
- Vehicle routing problems with loading constraints: state-of-the-art and future directions (Q2018104) (← links)
- Adaptive large neighborhood search for solving the circle bin packing problem (Q2027009) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- Queue-constrained packing: a vehicle ferry case study (Q2029061) (← links)
- Number of bins and maximum lateness minimization in two-dimensional bin packing (Q2029951) (← links)
- The maximum diversity assortment selection problem (Q2040441) (← links)
- 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← links)
