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 17 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)
• 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)