Pages that link to "Item:Q2643945"

The following pages link to An improved typology of cutting and packing problems (Q2643945):

Displaying 50 items.

• A branch and bound algorithm for the strip packing problem (Q1017971) (← links)
• New lower bounds based on column generation and constraint programming for the pattern minimization problem (Q1025240) (← links)
• Exact algorithms for the two-dimensional strip packing problem with and without rotations (Q1027586) (← links)
• A recursive algorithm for constrained two-dimensional cutting problems (Q1029631) (← links)
• The one-dimensional cutting stock problem with due dates (Q1038325) (← links)
• A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779) (← links)
• Strips minimization in two-dimensional cutting stock of circular items (Q1040959) (← links)
• Packing solar cells on a roof (Q1041385) (← links)
• Heuristics for container loading of furniture (Q1044119) (← links)
• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
• Collaborative urban transportation: recent advances in theory and practice (Q1631495) (← links)
• A local search-based method for sphere packing problems (Q1634289) (← links)
• Application of optimization for solving a sawing stock problem with a cant sawing pattern (Q1634783) (← links)
• A memetic algorithm to pack unequal circles into a square (Q1651582) (← links)
• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
• Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
• The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production (Q1652159) (← links)
• An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation (Q1652199) (← links)
• VCS: A new heuristic function for selecting boxes in the single container loading problem (Q1652261) (← links)
• Solving a large multicontainer loading problem in the car manufacturing industry (Q1652277) (← links)
• A clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
• Aircraft parking stand allocation problem with safety consideration for independent hangar maintenance service providers (Q1652562) (← links)
• Packing unequal rectangles and squares in a fixed size circular container using formulation space search (Q1652609) (← links)
• Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem (Q1662642) (← links)
• The skiving stock problem and its relation to hypergraph matchings (Q1662646) (← links)
• A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem (Q1665961) (← links)
• A customized branch-and-bound approach for irregular shape nesting (Q1668808) (← links)
• Two-dimensional cutting stock problem with sequence dependent setup times (Q1681356) (← links)
• A heuristic approach to minimize the number of saw cycles in small-scale furniture factories (Q1686524) (← links)
• Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem (Q1686525) (← links)
• A MIP-based slicing heuristic for three-dimensional bin packing (Q1686545) (← links)
• Dealing with nonregular shapes packing (Q1718651) (← links)
• A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems (Q1720775) (← links)
• A new quasi-human algorithm for solving the packing problem of unit equilateral triangles (Q1723821) (← links)
• Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case (Q1730578) (← links)
• Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review (Q1730669) (← links)
• Rectangle blanket problem: binary integer linear programming formulation and solution algorithms (Q1735167) (← links)
• Product packing and stacking under uncertainty: a robust approach (Q1740542) (← links)
• A sequential value correction heuristic for a bi-objective two-dimensional bin-packing (Q1742194) (← links)
• BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
• Matheuristics for the irregular bin packing problem with free rotations (Q1751657) (← links)
• Layout optimisation for an installation port of an offshore wind farm (Q1751774) (← links)
• A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem (Q1752837) (← links)
• A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (Q1754107) (← links)
• A new load balance methodology for container loading problem in road transportation (Q1754193) (← links)
• A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints (Q1754206) (← links)
• The load planning problem for double-stack intermodal trains (Q1754216) (← links)
• Optimal distribution of operating hours over operating rooms using probabilities (Q1754294) (← links)
• Packing of concave polyhedra with continuous rotations using nonlinear optimisation (Q1754302) (← links)
• A beam search approach to solve the convex irregular bin packing problem with guillotine guts (Q1754728) (← links)