Pages that link to "Item:Q1847188"

The following pages link to Two-dimensional packing problems: a survey (Q1847188):

Displaying 50 items.

• Quasi-phi-functions and optimal packing of ellipses (Q288226) (← links)
• Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges (Q296762) (← links)
• Constrained order packing: comparison of heuristic approaches for a new bin packing problem (Q300978) (← links)
• A hybrid evolutionary algorithm for the two-dimensional packing problem (Q301327) (← links)
• A hybrid algorithm based on variable neighbourhood for the strip packing problem (Q306099) (← links)
• A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints (Q319206) (← links)
• The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints (Q322687) (← links)
• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• Models for the two-dimensional two-stage cutting stock problem with multiple stock size (Q336416) (← links)
• An effective shaking procedure for 2D and 3D strip packing problems (Q336597) (← links)
• An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems (Q337083) (← links)
• Fast machine reassignment (Q338866) (← 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)
• A new heuristic algorithm for the circular packing problem with equilibrium constraints (Q350917) (← links)
• Corner occupying theorem for the two-dimensional integral rectangle packing problem (Q362160) (← links)
• Scheduling inspired models for two-dimensional packing problems (Q421612) (← links)
• Optimizing yard assignment in an automotive transshipment terminal (Q421631) (← links)
• A skyline heuristic for the 2D rectangular packing and strip packing problems (Q421662) (← links)
• An effective approximation algorithm for the malleable parallel task scheduling problem (Q433456) (← links)
• A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size (Q439486) (← links)
• Relations between capacity utilization, minimal bin size and bin number (Q490141) (← links)
• Parameterized complexity of strip packing and minimum volume packing (Q501656) (← links)
• Handling precedence constraints in scheduling problems by the sequence pair representation (Q511691) (← links)
• Numerical optimization method for packing regular convex polygons (Q519665) (← links)
• Space and time allocation in a shipyard assembly hall (Q610963) (← links)
• A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985) (← 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)
• The layout problem of two kinds of graph elements with performance constraints and its optimality conditions (Q815991) (← links)
• Compact visualisation of video summaries (Q836261) (← links)
• Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem (Q842766) (← links)
• A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation (Q863991) (← links)
• The constrained compartmentalised knapsack problem (Q868151) (← links)
• Two- and three-dimensional parametric packing (Q875405) (← links)
• On the complexity of adjacent resource scheduling (Q880528) (← links)
• Characterization and modelling of guillotine constraints (Q930945) (← links)
• A coupling cutting stock-lot sizing problem in the paper industry (Q940851) (← links)
• Reactive GRASP for the strip-packing problem (Q941532) (← links)
• A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem (Q941553) (← links)
• A least wasted first heuristic algorithm for the rectangular packing problem (Q960413) (← links)
• New lower bounds for bin packing problems with conflicts (Q976310) (← links)
• An integer programming model for two- and three-stage two-dimensional cutting stock problems (Q976382) (← 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)
• Bidimensional packing by bilinear programming (Q1016113) (← links)
• A branch and bound algorithm for the strip packing problem (Q1017971) (← links)