Pages that link to "Item:Q1017971"

The following pages link to A branch and bound algorithm for the strip packing problem (Q1017971):

Displaying 50 items.

• 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)
• A simple randomized algorithm for two-dimensional strip packing (Q339530) (← links)
• An exact strip packing algorithm based on canonical forms (Q339635) (← links)
• Scheduling inspired models for two-dimensional packing problems (Q421612) (← links)
• A skyline heuristic for the 2D rectangular packing and strip packing problems (Q421662) (← links)
• An exact method for the 2D guillotine strip packing problem (Q606187) (← links)
• A squeaky wheel optimisation methodology for two-dimensional strip packing (Q622159) (← links)
• Heuristic and exact algorithms for the multi-pile vehicle routing problem (Q657060) (← links)
• A new search procedure for the two-dimensional orthogonal packing problem (Q894552) (← links)
• A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem (Q941553) (← links)
• Exact algorithms for the two-dimensional strip packing problem with and without rotations (Q1027586) (← links)
• A branch-and-price algorithm for the two-dimensional level strip packing problem (Q1029564) (← links)
• Local search of orthogonal packings using the lower bounds (Q1040483) (← links)
• Exact algorithms for the guillotine strip cutting/packing problem. (Q1406705) (← links)
• Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
• A clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
• Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem (Q1686525) (← links)
• The value of integrating loading and routing (Q1752774) (← links)
• LP bounds in various constraint programming approaches for orthogonal packing (Q1761178) (← links)
• Conservative scales in packing problems (Q1944876) (← links)
• Grids for cutting and packing problems: a study in the 2D knapsack problem (Q2025135) (← links)
• Orientational variable-length strip covering problem: a branch-and-price-based algorithm (Q2028818) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• Enhanced formulation for the Guillotine 2D Cutting knapsack problem (Q2099494) (← links)
• A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints (Q2140338) (← links)
• Fragmentary structures in a two-dimensional strip packing problem (Q2174049) (← links)
• Order and static stability into the strip packing problem (Q2259026) (← links)
• A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem (Q2289918) (← links)
• A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
• Exhaustive approaches to 2D rectangular perfect packings (Q2390210) (← links)
• Triple-solution approach for the strip packing problem with two-staged patterns (Q2410108) (← links)
• The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview (Q2669629) (← links)
• An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem (Q2803256) (← links)
• Upper bounds for heuristic approaches to the strip packing problem (Q2803257) (← links)
• An exact approach to the strip-packing problem (Q2884561) (← links)
• A parallel branch-and-bound approach to the rectangular guillotine strip cutting problem (Q2899099) (← links)
• Combinatorial Benders' Cuts for the Strip Packing Problem (Q2935306) (← links)
• An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem (Q2960365) (← links)
• Metaheuristics for truck loading in the car production industry (Q2968504) (← links)
• An Exact Algorithm for the Two-Dimensional Strip-Packing Problem (Q3098338) (← links)
• Solving the irregular strip packing problem via guided local search for overlap minimization (Q3401324) (← links)
• One-dimensional relaxations and LP bounds for orthogonal packing (Q3401330) (← links)
• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing (Q4018533) (← links)
• Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
• A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands (Q6060670) (← links)
• Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization (Q6067890) (← links)
• Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts (Q6087527) (← links)
• Approximation Algorithms for Demand Strip Packing (Q6090894) (← links)
• A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery (Q6565397) (← links)