Pages that link to "Item:Q703155"

The following pages link to A general framework for bounds for higher-dimensional orthogonal packing problems. (Q703155):

Displaying 46 items.

• A hybrid algorithm for constrained order packing (Q301159) (← links)
• On the weak computability of a four dimensional orthogonal packing and time scheduling problem (Q391303) (← links)
• A skyline heuristic for the 2D rectangular packing and strip packing problems (Q421662) (← links)
• Relations between capacity utilization, minimal bin size and bin number (Q490141) (← links)
• Using dual feasible functions to construct fast lower bounds for routing and location problems (Q499343) (← links)
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing (Q610979) (← links)
• Optimal rectangle packing (Q610984) (← links)
• A survey of dual-feasible and superadditive functions (Q610986) (← links)
• Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution (Q664176) (← links)
• The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem (Q724050) (← links)
• Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem (Q842766) (← links)
• New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation (Q868985) (← links)
• Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← links)
• New lower bounds for bin packing problems with conflicts (Q976310) (← links)
• An agent-based approach to the two-dimensional guillotine bin packing problem (Q1011220) (← links)
• Bidimensional packing by bilinear programming (Q1016113) (← links)
• A branch and bound algorithm for the strip packing problem (Q1017971) (← links)
• A branch-and-price algorithm for the two-dimensional level strip packing problem (Q1029564) (← links)
• A new quasi-human algorithm for solving the packing problem of unit equilateral triangles (Q1723821) (← links)
• A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates (Q1754152) (← links)
• LP bounds in various constraint programming approaches for orthogonal packing (Q1761178) (← links)
• Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows (Q1788902) (← links)
• Conservative scales in packing problems (Q1944876) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• Queue-constrained packing: a vehicle ferry case study (Q2029061) (← links)
• A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem (Q2077966) (← links)
• Lower bounds for three-dimensional multiple-bin-size bin packing problems (Q2260892) (← 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)
• A new lower bound for the non-oriented two-dimensional bin-packing problem (Q2467479) (← links)
• New resolution algorithm and pretreatments for the two-dimensional bin-packing problem (Q2482368) (← links)
• Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems (Q2569035) (← links)
• A new exact method for the two-dimensional orthogonal packing problem (Q2643952) (← links)
• Single batch machine scheduling with dual setup times for autoclave molding manufacturing (Q2668803) (← links)
• The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview (Q2669629) (← links)
• Upper bounds for heuristic approaches to the strip packing problem (Q2803257) (← links)
• Determining the best shipper sizes for sending products to customers (Q2803267) (← links)
• (Q2861507) (← links)
• An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem (Q2960365) (← links)
• New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem (Q3114308) (← links)
• One-dimensional relaxations and LP bounds for orthogonal packing (Q3401330) (← links)
• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)
• (Q5088965) (← links)
• An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
• Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization (Q6067890) (← links)
• A two-phase constructive algorithm for the single container mix-loading problem (Q6596958) (← links)