Pages that link to "Item:Q868985"

The following pages link to New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation (Q868985):

Displaying 39 items.

• Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem (Q297181) (← links)
• Constrained order packing: comparison of heuristic approaches for a new bin packing problem (Q300978) (← links)
• A hybrid algorithm for constrained order packing (Q301159) (← links)
• A preemptive bound for the resource constrained project scheduling problem (Q398922) (← 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)
• Preprocessing and an improved MIP model for examination timetabling (Q492792) (← links)
• A new destructive bounding scheme for the bin packing problem (Q610978) (← links)
• A survey of dual-feasible and superadditive functions (Q610986) (← links)
• Theoretical investigations on maximal dual feasible functions (Q974987) (← links)
• New lower bounds for bin packing problems with conflicts (Q976310) (← links)
• A branch and bound algorithm for the strip packing problem (Q1017971) (← links)
• The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case (Q1429289) (← links)
• Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← links)
• Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems (Q1734832) (← links)
• LP bounds in various constraint programming approaches for orthogonal packing (Q1761178) (← links)
• Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem (Q1762094) (← links)
• Constructing general dual-feasible functions (Q1785396) (← links)
• Worst-case analysis of maximal dual feasible functions (Q1926616) (← links)
• A constraint programming approach for a batch processing problem with non-identical job sizes (Q1926887) (← links)
• MPQ-trees for the orthogonal packing problem (Q1935724) (← 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 three-dimensional bin-packing model: exact multicriteria solution and computational complexity (Q2404356) (← 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)
• A new exact method for the two-dimensional orthogonal packing problem (Q2643952) (← links)
• Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) (← 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)
• A computational study of lower bounds for the two dimensional bin packing problem (Q2861507) (← links)
• MPQ-trees for orthogonal packing problem (Q2883589) (← links)
• New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem (Q3114308) (← links)
• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)
• Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
• A combinatorial flow-based formulation for temporal bin packing problems (Q6109803) (← links)