Pages that link to "Item:Q2892309"
From MaRDI portal
The following pages link to Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem (Q2892309):
Displaying 50 items.
- A hybrid heuristic algorithm for the 2D variable-sized bin packing problem (Q296697) (← links)
- A heuristic for solving large bin packing problems in two and three dimensions (Q300728) (← links)
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry (Q319718) (← links)
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size (Q336416) (← links)
- A constraint programming based column generation approach to nurse rostering problems (Q339698) (← links)
- The load-balanced multi-dimensional bin-packing problem (Q342477) (← links)
- The three-dimensional knapsack problem with balancing constraints (Q440966) (← links)
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem (Q609809) (← links)
- Space and time allocation in a shipyard assembly hall (Q610963) (← links)
- Routing problems with loading constraints (Q610992) (← links)
- The off-line group seat reservation problem (Q613435) (← links)
- Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints (Q729798) (← links)
- Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem (Q875412) (← links)
- Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← links)
- Multi-dimensional bin packing problems with guillotine constraints (Q976021) (← links)
- An integer programming model for two- and three-stage two-dimensional cutting stock problems (Q976382) (← links)
- Bidimensional packing by bilinear programming (Q1016113) (← links)
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
- Constraint programming and operations research (Q1616390) (← links)
- Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling (Q1751262) (← links)
- Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling (Q1752822) (← links)
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function (Q1753400) (← links)
- A column generation approach for the integrated shift and task scheduling problem of logistics assistants in hospitals (Q1753439) (← links)
- Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
- LP bounds in various constraint programming approaches for orthogonal packing (Q1761178) (← links)
- Exact algorithms for the two-dimensional guillotine knapsack (Q1761943) (← links)
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts (Q1761944) (← links)
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows (Q1788902) (← links)
- A global optimization point of view to handle non-standard object packing problems (Q1941035) (← links)
- Conservative scales in packing problems (Q1944876) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem (Q2030652) (← links)
- Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect (Q2060398) (← links)
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem (Q2099494) (← links)
- Packing ovals in optimized regular polygons (Q2173521) (← links)
- Heuristics for packing semifluids (Q2286867) (← links)
- Deterministic model for customized pilot manufacture production with various backplane sizes (Q2310672) (← links)
- A branch-and-price algorithm for the two-dimensional vector packing problem (Q2329474) (← links)
- A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
- A new constraint programming approach for the orthogonal packing problem (Q2456654) (← links)
- A new exact method for the two-dimensional bin-packing problem with fixed orientation (Q2467477) (← links)
- The two-dimensional bin packing problem with variable bin sizes and costs (Q2568334) (← links)
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem (Q2643948) (← links)
- Models and algorithms for three-stage two-dimensional bin packing (Q2643961) (← links)
- An exact branch-and-price approach for the medical student scheduling problem (Q2668624) (← links)
- Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics (Q2672119) (← links)
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container (Q2673561) (← links)
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts (Q2675700) (← links)
- Two dimensional guillotine cutting stock and scheduling problem in printing industry (Q2676408) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
