Pages that link to "Item:Q1429289"

The following pages link to The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case (Q1429289):

Displaying 30 items.

• A hybrid algorithm for constrained order packing (Q301159) (← links)
• A Lagrangian heuristic for sprint planning in agile software development (Q336900) (← links)
• Lower and upper bounds for the bin packing problem with fragile objects (Q406499) (← 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)
• A survey of dual-feasible and superadditive functions (Q610986) (← links)
• Routing problems with loading constraints (Q610992) (← links)
• The off-line group seat reservation problem (Q613435) (← links)
• New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation (Q868985) (← links)
• New lower bounds for bin packing problems with conflicts (Q976310) (← links)
• Bidimensional packing by bilinear programming (Q1016113) (← links)
• A branch and bound algorithm for the strip packing problem (Q1017971) (← 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)
• Space defragmentation for packing problems (Q1926954) (← links)
• Conservative scales in packing problems (Q1944876) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← 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)
• 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)
• A new exact method for the two-dimensional orthogonal packing problem (Q2643952) (← links)
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
• (Q2861507) (← links)
• Prospective Network Flow Models and Algorithms for Bin Packing Problems (Q2883549) (← links)
• Ond-threshold graphs andd-dimensional bin packing (Q3157035) (← links)
• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)